Suppose there are four page frames, all initially unused. Consider the following sequence of page references (each element in the sequence represents a page number) 012 5 34113 53025 415 244 Determine by filling the below tables when page faults occur for the page replacement algorithms (i) optimal, ii) least recently used (LRU), (i) first-in-first-out (FIFO), and iv) clock. In case of a tie, re faults. place the page with the smaller page number. Mark to indicate the occurrence of page Optimal Page seq Frame 1 Frame 2 Frame 3 Frame 4 age fault LRU Page seq Frame 1 rame 2 rame 3 Frame 4 Page fault FIFO Page seq rame 1 Frame 2 Frame 3 rame 4 Page fault Clock: Page seq rame 1 Frame Frame 3 Frame 4 Page fault