$($c$)$ Consider the following page reference string:

$0,1,3,2,0,2,6,5,1,2,3,2,1,2,6,2,1,3,6,2.$

Calculate the page faults will occur if the program has three $(3)$ page frames

available to it and uses the following algorithm:

$($i$)$ FIFO $($First In First Out$)$ replacement

$($ii$)$ LRU $($Least Recently Used$)$ replacement

$(7$ marks$)$