Consider the following page reference string: $7,0,1,2,0,3,0,4,2,3,0,3,1,2,0$ How many page faults would occur for the First in First out $($FIFO$),$ assuming three frames? FIFO Rule: Oldest page in the memory will be replaced. It has lowest page fault rate..