Assume 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) requests pages in the following order: a, c, a, b, a, d, a,...

Assume 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) requests pages in the following order:
a, c, a, b, a, d, a, c, b, d, e, f
2.1 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 and success ratios