1. Consider the following page reference string: 2, 1,5, 6, 2, 1, 2, 1, 7, 6, 3, 2, 1, 2, 3, 6 (using the belowtable Answer the followingquestions.)
Further assume that there are four frames in the system, whereall of the frames are initially empty.
(a) For the LRU (Least Recently Used) page replacementalgorithm, fill the table where each column represents the framesafter each page reference.(Note that the last row is the referencestring.) Then specify how many page faults it generates. Mark allthe references that generate a page fault with “*”.
(b)For the Belady’s optimal page replacement algorithm,
OR
OR