Question 6: (10 marks) Based on Chapter 10. Consider the following page reference string: 6, 7,5, 1, 7,3,5, 0, 2, 6, 6, 1,4,3,0, 2, 7, 3, 4, 1. a) Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Show this by drawing the placement of pages in the frames after each reference for each algorithm and at the end write the number of page faults. FIFO replacement LRU replacement (9 marks) b) Which replacement algorithm is better? (1 mark)