c$)$ In a page replacement context, given the sequence

$7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1,$ complete the frames of the table if

i$)$ there are $3$ frames and a FIFO first in first out algorithm is used, e$.$g$.$:

ii$)$ there are $3$ frames and an optimal algorithm is used.

iii$)$ there are $4$ frames and a FIFO first in first out algorithm is used.

iv$)$ For each case, count the number of page faults.