First number is a 1

A page replacement algorithm should minimize the number of page faults. Assume we have reference the following memory reference string. 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2. i. How many page faults occur for LRU algorithm for the above reference string with five page frames? Justify your answer. ii. What is the minimum number of page faults for an optimal page replacement strategy for the above reference string with four page frames? Justify your