Consider the following page reference string 7, 2, 3, 1, 2, 5, 3, 4, 6, 7,7, 1, 0, 5, 4, 6, 2, 3, 0,1 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? a. LRU replacement b. FIFO replacement c. Optimal replacement Grading Rubric: 1 point if ALL three subquestions are correctly answered with illustrations similar as the following figure. 0 point otherwise.] reference string 3 3 3 2 2 2 1 0 0 03 3 page frames