In demand paging, a page replacement policy is used to manage system resources. Given that main memory has 4 page frames (C, E, I, T) available to programs and that a program consisting of 16 pages is to be loaded in main memory. The request pages are provided below in order: 2 1 2 1 4 3 1 0 2 4 0 3 1 2 4 1 Suppose that all the page frames are initially empty. a) Using the Most Recently Used (MRU) page removal algorithm and do a pages trace analysis indicating the page faults. b) Calculate the failure and success rates