Extracted text: Consider the following page reference string: 4, 2, 6, 1, 2, 3, 8, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 8. How many page faults would occur for the FIFO replacement algorithm, assuming five frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each.