Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical memory, how many page faults will occur for the following replacement algorithms: a. FIFO Replacement algorithm: (2 marks) b. Optimal Replacement algorithm: (2 marks) CLRU replacement algorithm: (2 marks) Write your detailed answer as the following for each algorithm: Read A: Frame1, Frame2, Frame3 Read C: Frame1. Frame2, Frame3 Read D: Frame1, Frame2, Frame Read B: Frame1. Frame2, Frame3 Read A: Frame1. Frame2, Frame3 Read C: Frame1, Frame2, Frame3 Read E: Frame1, Frame2, Frame3 Read A: Frame1, Frame2, Frame3 Read C: Frame1, Frame2, Frame3 Read D: Frame1, Frame2, Frame3 Read B: Frame1, Frame2, Frame3 Read E: Frame1, Frame2, Frame3 Note: Your grades will be on your detailed answer rather than page faults. Use the editor to format your