Task 9. Total 15% Consider the following page reference string: 1, 2, 3, 4, 1, 2, 6, 2, 1, 3, 2, 3, 4, 5, 3, 2, 4 Assumptions: . There are FOUR (4) pages of main memory The page table is initially empty Consider the following THREE (3) page replacement algorithms. 1. First-In-First-Out (FIFO) Algorithm 2. Optimal Algorithm 3. Least-Recently Used (LRU) Algorithm 1. For each algorithm: . Clearly show the page frames in the page table after each request. Put a dash ("-") to indicate an empty entry. Circle the page number in the page table if the page is just brought in due to a page fault. Tie-breaking: If there is more than one candidate page that can be replaced, replace the one with the lower page frame number. ii. Calculate the hit ratio of each algorithm. Give your answer in fraction or in percentage