Problem
1. Consider an initially empty memory cache consisting of four pages. How many page misses does the FIFO algorithm incur on the following page request sequence: (2,3,4,1,2,5,1,3,5,4,1,2,3)?
2. Show each level of recursion in performing a four-way mergesort of the sequence given in the previous exercise.