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$

answer the following questions.

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