Concider the following page reference string: 7, 0, 3, 1, 3, 5, 4, 6, 5. Assuming demandpaging with three frames, how many page faults would occur for the following replacement algorithms?

1) FIFO replacement. 2) LRU replacement.

Thank you, it would be nice if it is well written and explained well.