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, b, c, b, d, a, e, f, b, e, d, 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) indicating each page fault with an asterisk (*). Then compute the failure ratio and success ratio.

b. Using FIFO again, increase the size of memory so it contains four page frames for public use. Using the same page requests as above, do another page trace analysis and compute the failure and success ratios.

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

d. What conclusions do you draw from this comparison of FIFO and LRU performance? Would you make general statements from this example? Explain why or why not.