suppose a process has the following reference string (sequence of page accesses):1 2 3 4 1 2 4 2 3 1 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? (show all work.)