operating system need this done by professionals

4. (25 points) A computer has four page frames. The time of loading, time of last access, and the R. (referenced ) and M ( Modified ) bits for each page are show n below (the times are in clock ticks ) Page Loaded Last Reference R M 126 230 120 150 279 260 272 280 Answer and explain briefly your answer for each of the following: a) Which page will NRU replace ? b) Which page will FIFO replace? c) Which page will LRU replace ? d) Which page will FIFO with second chance replace ? show a hardware implementation of the least- . Figure (a) shows that 5. (20 points) The following sequenc e of diagrams recently-used (LRU) page replacement algorithm that can handle 4 pages page 0 is accessed. What page is accessed in each of the subsequent figures: (b), (c), (d), (e), (f) (g), (h), (i), and (G)? Explain your answers Page Page 0 1 2 3 Page Page 012 3 Page 0 12 3 o 0 1 1 1 2 0 0 0 0 0 oo 0 1 1 1 10 0 0