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):

Page	Loaded	Last ref	R	M
0	50	279	0	1
1	110	232	1	1
2	212	267	1	0
3	112	277	0	1

Given the above state,

a. Which page will the second-chance algorithm replace if needed?

b. Which page will the FIFO algorithm replace if needed?

c. For each algorithm, mention why which page is selected.