In the First In First Out (FIFO) page replacement algorithms, operating system keeps track of all pages in the memory in a queue, oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal. Consider page reference string A, B, C, B, A, E, B, A, F, B, E, F, C,A, C, F, A, B, D, C Let there be 3 page slots. How many page faults will occur? 10 0 11 12 133 0 14 15