Problem D$,3\mathrm{.}75(1\mathrm{.}25pt$ each$)$ Write answers, show your work, provide as many detalls as needed.

Consider the following page reference string:

$5,1,0,2,1,4,4,0,6,0,3,1,2,1,0$

Suppose that we apply demand paging with four frames. How many pagn hits would occour for the following replacement algorithm: FIFO?

Given the same sequence as above, and the same number of frames. How many page faults would occur for the following replacement algorithm: LRU?