Consider a system in which a process is allocated three frames in memory. Given the page requests of this process as 1, 4, 5, 3, 4, 5, 6, 1, 7, 5, 6, 1, 3, 2, 6, 5, 2, 1, 5, 2, trace the utilization of the three frames by this process when using the Optimal, FIFO, LRU replacement algorithms. To compare the efficiency of using each algorithm, find the total number of page faults and the effective access time. Assume that the memory access time is 100 nanoseconds and the average page-fault service time is 4 microseconds.

Optimal Replacement FIFO Replacement LRU Replacement