Given that main memory is composed of three page frames for public use and that a program requests pages in the following order: a,b,a,b,f,d,f,c,g,f,g,b,d,e

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 an asterisk (*). Then compute the failure and success ratios.

B. Using the LRU page removal algorithm, perform a page trace analysis and compute the failure and success ratios.

C. What conclusions can you draw from this comparison of FIFO and LRU performance? Could you make general statements from this example? Explain why or why not.