Consider the following string of page references: $7,0,1,2,0,3,0,4,2,3,0,3,2.$

Given an empty main memory with $3$ page frames, find out the total number of page faults for the LRU page replacement algorithm. Count page faults only after all frames have been initialized.

$5.$a

$3.$b

$6.$ C

$7.$d