The best possible page replacement algorithm is easy to describe but impossible to actually implement. It goes like this. At the moment that a page fault occurs replace the page that will not be referenced again until furthest in the future. This algorithm (often denoted as OPT) is not realizable (since we typically do not know the future) but it is a useful benchmark to which we compare realizable strategies like FIFO or LRU. Suppose that we have a system with four page frames and a program consisting of 8 pages (numbered 0 – 7). If the pages are requested in the order 3, 1, 2, 2, 3, 2, 7, 1, 0, 4, 3, 1, 1, 6, 2, 6, 7, 0, 5, 7, 5, 5, 6, 3, 7 a. Using FIFO page replacement algorithm indicate, the movement of the pages into and out of the available page frames, indicating each page fault with an asterisk. Compute the failure ratio and success ratio. b. Repeat part a for LRU page replacement algorithm. c. Repeat part 1 for OPT algorithm.