b) Trace the following Paging Algorithms and determine the total number of page faults for each. Which algorithm gave you the best solution? Which one gave you the worst? FIFO Algorithm: Page Referencing Stream: 1 2 3 4 75 7 1 46 4 1 7 Frame 1: Frame 2: Frame 3: Frame 4: Page Faults: Optimal Algorithm: Page Referencing tream: 1 2 3 4 7 5 7 1 4 6 4 1 7 Frame 1: Frame 2: Frame 3: Frame 4: Page Faults: LRU Algorithm: Page Referencing Stream: 1 2 3 4 75 7 1 46 4 17 Frame 1: Frame 2: Frame 3: Frame 4: Page Faults: Note: If there is a 'tie", that is, there is more than one page that a new page could replace, go with the one with the lowest/smallest frame number