(b) Assume a main memory is composed of two-page frames for public use and that a program requests pages in the following order: A, B, D, D, D, B, A, A, B, C, C, B

Using the First-In-First-Out (FIFO) page removal algorithm, perform a page trace analysis indicating page faults with asterisks (*)