On a hard disk of a computer system, a process is made of eight (8) virtual pages and is assigned a fixed allocation of four (4) page frames in the system main memory. Assume that the frames are initially empty. Consider the following page reference string: 1,0,2, 2, 1, 7,6, 7,0, 1,2, 0, 3,0, 4, 5, 1, 5,2, 4, 5, 6,7, 6,7,2,4,2,7,3, 3,2,3 Using the following replacement algorithms, show the successive pages residing in the four frames and compute the hit ratio and miss rate for each algorithm. Make sure that you use tables to show the frames' contents. a) LRU b) FIFO c) Optimal