For question 1,2, and 3, consider the following page reference string: A, B, C, D, B, A, E, F, B, A, B, C, G, F, C, B, A, B, C, F. How many page faults would occur for the following replacement algorithms, assuming four frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each Your answer 2 points 1. FIFO replacement O 15 O 14 0 12