The Second-Chance algorithm is same as FIFO algorithm if none of the pages in memory have been referenced since the last page fault. is same as LRU algorithm if all pages in memory have been referenced at least once since the last page fault. is same as LRU algorithm if none of the pages in memory have been referenced since the last page fault. is same as FIFO algorithm if all pages in memory have been referenced at least once since the last page fault.

The correct option is 4th option.

Explanation:  

The second-chance algorithm is the same as the FIFO algorithm if all pages in memory have been referenced at least once since the last page fault.  

In the second-chance algorithm, the page is assigned a reference bit whenever it's visited. therefore the page recently visited isn't swapped out  

It works like FIFO. But rather than directly removing the page this algorithm checks for the reference bit. If the reference bit is about the page isn't removed otherwise it's swapped out.