1) Consider the following page reference string: 1, 2, 3, 4, 5, 2, 4, 6, 3, 5, 4, 1, 4, 1, 6, 2, 5, 4, 2, 3. How many page faults would occur if the LRU replacement algorithm is used? All frames are initially empty.

A) Assume one frame available

B) Assume 2 frames available

C) Assume 4 frames available

D) Assume 8 frames available

2) Consider the following page reference string: 1, 2, 3, 4, 5, 2, 4, 6, 3, 5, 4, 1, 4, 1, 6, 2, 5, 4, 2, 3. How many page faults would occur if the FIFO replacement algorithm is used? All frames are initially empty.

A) Assume one frame available

B) Assume 2 frames available

C) Assume 4 frames available

D) Assume 8 frames available