Answer the following questions based on the Memory Management tasks of an Operating System.

Consider the following sequence of page references:

6, 4,3,6,4,2,1,8

Assuming that 3 frames are initially empty, indicate the contents of memory after each reference, and how many page faults are found for each of the following page replacement algorithms:

a) FIFO

b) LRU

6 4 3 6 4 2 1 8 Fra me 0 Fra me 1 Fra me 2 Page Faul t->