ich page will FIFO with second chance replace ? 5. (20 points) The following sequence of diagrams show a hardware implementation of the least- recently-used (LRU) page replacement algorithm that can handle 4 pages. Figure (a) shows that page 0 is accessed. What page is accessed in each of the subsequent figures: (b), (c). (d), (e),() (g), (h), (i), and (G)? Explain your answers. Page Page Page Page Page 0 12 3 0 0 1 11 10 0 0 0 11 01 0 0 0 1)