$7.$ Points $15$: Suppose there are $3$ frames of memory currently loaded with pages $5,3,1$ in that order. Show each step of page replacement from this initial state and set of page requests using an LRU replacement policy. The page requests are $4,1,2,5.$

$8.$ Points $15$: Suppose there are $3$ frames of memory currently loaded with pages $5,3,1$ in that order. Using a Clock replacement policy, show each step for the following page requests, assuming the use bit is already set for pages $5$ and $1,$ with the replacement pointer on $3.$ The page requests are $4,1,2,5.$