Assume that main memory is composed of four frames, and that a program requests pages in the following order: $7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1.$ Assume the main memory is initially empty.

$1.$ Using FIFO replacement, with using various frame size as follows: $1,2,3,4,$ and $5.$ How many page faults will occur? What are the final pages in memory? Show the Page Faults Versus the Number of Frames on Graph

$2.$ Using LRU replacement, frame size is $4.$ How many page faults will occur? What are the final pages in memory?

$3.$ Using Optima replacement, frame size is $4.$ How many page faults will occur? What are the final pages in memory?