Suppose a process has the following reference string (sequence of page accesses): 1 2 3 4 1 3 4 2 2 4 1 3 1 2. The process referencing this sequence of pages has a fixed allocation of three page frames. How many page faults would occur under each of the following replacement policies:

A) FIFO

B) LRU

C) Optimal