A process has four page frames allocated to it. (All the following numbers are decimal, and everything is numbered starting from zero.) The time of the last loading of a page into each page frame, the last access to the page in each page frame, the virtual page number in each page frame, and the referenced (R) and modified (M) bits for each page frame are as shown (the times are in clock ticks from the process start at time 0 to the event). Virtual Page Number | Frame | Time Loaded | Time Referenced | R Bit 20 0 60 161 0 22 1 130 160 1 24 2 10 162 1 31 3 20 163 1 A page fault to virtual page 23 has occurred at time 164. Which frame will have its contents replaced for each of the following memory management policies? FIFO (first-in-first-out) LRU (least recently used) Clock algorithm. Assume the clock arm moves circularly in increasing frame number and points to the frame immediately next the one that was most recently updated. Optimal. Use the reference string generated by the following program, considering the following parameters: the system has 256-byte pages. The program is located at address 1020, and its stack pointer is at 8190 (the stack grows toward 0). Each instruction occupies 4 bytes (1 word), and both instruction and data references count in the reference string.

Load word 6144 into register 0 Push register 0 onto the stack Call a procedure at 5120, stacking the return address Subtract the immediate constant 16 from the stack pointer and place it in register RC Compare the value in RC to the immediate constant 4 Jump if equal to 5152

Reference String:

Frame replaced by Optimal: