Q3. (5 points) 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 cloclk ticks) Loaded 50 110 212 112 Last ref 279 232 267 277 Page Given the above state, a. Which page will the second-chance algorithm replace if needed? b. Which page the FIFO algorithm replace if needed? For each algorithm, mention why which page is selected. (5 points)