35. Suppose a memory system has two pages and it is initially empty Assume that we reference pages 1, 2, 2, 1, 5, 1 using FIFO page replacement policy. The memory at the end will look like: 36. Suppose a memory system has two pages and it is initially empty Assume that we reference pages 1, 2, 2, 1, 5,1 using LRU page replacement policy. The memory at the end will look like: 37, Suppose a memory system has two pages and it is initially empty Assume that we reference pages 1, 2,1, 5, 1 using optimal page replacement policy. The memory at the end will look like: For the question below, suppose that three processes P, P and P, (in-order) with length of 4, 2, and 6, arrive at time 0. Answer the following. 38. If FCFS scheduling is used, then the through put of the system at the end of 12 units of time (seconds) is A. 3 seconds job B. 3 job/seconds C. 0.33 seconds/iob D. 0.25 jobs/seconds E. None of the above 39. If FCFS scheduling is used, then the wait times for P, P. and P, are A. 6, 4, and 0 B, 0, 4, and 6 C. 4, 2, and 6 D. 2, 0, and 6 E. None of the above 40. If SJF scheduling is used, then the wait times for P, P, and P,are A. 6, 4, and 0 B. 0, 4, and 6 C. 4, 2, and 6