Consider the following page-reference string:1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6How many page faults would occur for the following replacement algorithms, assuming three frames? Remember all frames are initially empty. A. FIFO replacement b. LRU replacement c. Optimal Mention the merits and demerits of each of the above algorithms.
Let’s analyze each replacement algorithm for the given page-reference string: FIFO (First In, First Out): FIFO replacement algorithm replaces the …