Exercise 4: Consider a central memory M1 consisting of 2 frames and a secondary memory M2. Let P=1213124134 the reference string to pages 1,2,3,4, initially located in M2. Using demand paging to move the pages from M2 to M1, calculate the following: Note: We define the success rate s as follows: s=1(F/L) where F is the number of page faults and L is the length of the reference string P 1. How many page faults occur for the reference string P, when using FIFO replacement page algorithm? Total Number of Page Faults: ? Success Rate: 2. Repeat using the LRU strategy. Total Number of Page Faults: ? Success Rate