Assume that a computer has four page frames. The time of loading, time of last access (Last Ref), and the R and M bits for each page are as follows (the times are in clock ticks): Given the above state, a. Which page will the second-chance algorithm replace if needed? b. Which page will the NRU (Not Recently Used) algorithm replace if needed? c. Which page will the FIFO algorithm replace if needed? For each algorithm, mention why which page is selected. ( 6 points)