Exercise $6$

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.$

Used in e$-$frame memory space. How many page faults would occur for the following replacement algorithms:

FIFO

Optimal