Operating System Suppose the virtual memory system has 8 pages marked as A,B,C,D,E,F,G,H, and 3 frames initially empty. For each of the following demand paging sequence E,D,H,B,D,E,D,A,E,B,E,D,E,B,G, list the total number of page faults and write down the process of page replacement: a) Optimal (also called MIN) page replacement policy: (7 points) b) Least Recent Used (LRU) page replacement policy: (7 points) c) First In First Out (FIFO) page replacement policy: (6 points) Reference E D H B D E D A E B E D E B G Frame 1 Frame 2 Frame 3 Mark X for a fault