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

a. Using the FIFO page removal algorithm, perform a page trace analysis and indicate page faults with asterisks(*). 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 do you draw from this comparison of FIFO and LRU performance? Could you make general statements from this example? Explain why or why not.