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, 6 How many page faults would occur for the following replacement algorithms. where frames size is...

answer this question please

Extracted text: 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, 6 How many page faults would occur for the following replacement algorithms. where frames size is three? Remember that all frames are initially empty, so your first unique pages will cost one fault each. i) LRU Replacement i1) FIFO Replacement i11) Optimal Replacement