operating system solve it please in 20 min maximum please , be fast please , I will give u a like

Consider the following page reference string C, A, B, E, C, A, D, C, A, B, E, D Suppose there are 3 frames in physical memory, how many page faults will occur for the following replacement with a. FIFO Replacement algorithm: (2 marks) b. Optimal Replacement algorithm: (2 marks) c. LRU replacement algorithm: (2 marks) Write your detailed answer as the following for each algorithm: Read C: Frame1, Frame2, Frame3 Read A: Frame1, Frame2, Frame3 Read B: Frame1, Frame2, Frame3 Read E: Frame 1, Frame2, Frame3 Read C: Frame1, Frame2, Frame3 Read A: Frame1, Frame2, Frame3 Read D: Frame1, Frame2, Frame3 Read C: Frame1, Frame2, Frame3 Read A: Frame1, Frame2, Frame3 Read B: Frame1, Frame2, Frame3 Read E: Frame 1, Frame2, Frame3 Read D: Frame1, Frame2, Frame3