Consider the following page reference string :
$1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6$
Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page replacement algorithms respectively, assuming $05$ page frames and all frames are initially empty ?
- $10, 14, 8$
- $8, 10, 7$
- $7, 10, 8$
- $7, 10, 7$