Consider a system with demand-paged memory, without which the average time to deal with a fault page size is X when there is an empty frame or the page to be replaced has not been modified, and 2X if the page to be replaced has been modified. The system has a TLB (associative memory) to accelerate the translation process. The average access time to the TLB is 10 nanoseconds and the memory is 50nanoseconds. On average, 20% of the requisitions available an empty frame and 60% demand the replacement of pages that have not been modified. The success rate of consultations with the TLB is 70% and 1% Capture memory access generates page faults. What should be the value of X for the timeaverage effective access to memory does not exceed 10 ms?

Write a program that keeps asking the user for new values to be added to a list until the user enters 'exit' ('exit' should not be added to the list). these values entered by the user are added to a list we call 'initial_list'. then write a function that takes this initial_list as input and returns another list with 3 copies of every value in the initial_list. finally, inside print out all of the values in the new list. for example: input: enter value to be added to list: a enter value to be added to list: b enter value to be added to list: c enter value to be added to list: exit output: a b c a b c a b c note how 'exit' is not added to the list. also, your program needs to be able to handle any variation of 'exit' such as 'exit', 'exit' etc. and treat them all as 'exit'.