Consider the virtual page reference string
$\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$
On a demand paged virtual memory system running on a computer system that main memory size of $3$ pages frames which are initially empty. Let $\text{LRU, FIFO}$ and $\text{OPTIMAL}$ denote the number of page faults under the corresponding page replacement policy. Then
- $\text{OPTIMAL < LRU < FIFO}$
- $\text{OPTIMAL < FIFO < LRU}$
- $\text{OPTIMAL = LRU}$
- $\text{OPTIMAL = FIFO}$
