Q. Consider the following page reference string: 8, 12, 6, 8, 17, 13, 1, 14, 8, 6, 14, 15, 16, 7, 8, 4, 3, 11, 14, 8, 9

[answerhappygod]

Q.
Consider the following page reference string:
8, 12, 6, 8, 17, 13, 1, 14, 8, 6, 14, 15, 16, 7, 8, 4, 3, 11,14, 8, 9
How many page faults would occur for the following replacementalgorithms, assuming three, four, and five
frames? Remember that all frames are initially empty, so yourfirst unique pages will cost one fault each.
a. LRU replacement
b. FIFO replacement
c. Optimal replacement
d. LFU replacement