(c) 13 2 4 2 563 42 15 5 5 632 FCFS 161751 5 5 5 5 234 3 3 3 3 3 6 6 6 6 6 6 G Total 8 Fault 2 2 2 2 2 3 3 3 3 3 3 4 4 4 4 4 4 2 2 2 2 PFPF PF PF HiT PF PF PF HiT PF Hit Hit Hit We have a paging system with 4 frames and 13 pages. The number of frames denotes the number of pages that can be held in RAM at any given time. The pages are accessed by some processes in the order shown below. The paging system has just started and the frames are initially empty. Order in which pages are accessed: from left to right 1, 3, 2, 4, 2, 5, 6, 3, 4, 2, 6, 3, 2 If the FIFO (Frist-In-First-Out) algorithm is used, how many page faults will be generated? Show your working. [4 marks]