6. Given that main memory is composed of only three page frames for public use and that a program requests pages in the following order: A, C,B, D,A, C,E, A,C, B,D, E a. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frame. Indicate each page fault with an asterisk. Then compute the failure and success ratios.