Consider a hypothetical machine with 3 pages of physical memory, 5 pages of virtual memory, and as the stream of page references by an application. If P and Q are the number of page faults the application would incur with the FIFO and LRU page-replacement algorithms respectively (assuming enough space for storing 3 page frames), then (P, Q) = ____.

1. A(A) (11,10)
2. B(B) (12,11)
3. C(C) (10,11)
4. D(D) (11,12)

Pick an option to check yourself, or open the answer below.