Given that main memory is composed of only three page frames for public use and that a seven-page program (with Pages a, b,c, d,e, f,g) that requests pages in the following order a, c,a, b,a, d,a, c,b, d,e, f

a.) Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis), Indicate each page fault with a asterisk(*). Then compute the faliure and sucess raitos.
b) Increase the size memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace and analysis and compute the failure and sucess ratios.
c) What general statment can you make from this example? Explain your answer.