Problem $2$: Consider a central memory M$1$ consisting of $2$ frames and a secondary memory M$2.$ Let P $=1213124134$ the reference string to pages $1,2,3,4,$ initially located in M$2.$ How many page faults occur for the reference string P$,$ when using FIFO replacement page algorithm? $1213124134$ F$1$ F$2$ p$.$f 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$.$ Calculate s in case $1...............................$