1. Consider a reference string: 3 6 3 4 251 6 2 3 4 5 6 55 413 1 32 7 51 4 2 There are a total of 4 page frames available a. Construct the page replacement table for FIFO algorithm and record how many page faults. Fill in the page table after each reference. 3 6 3 4 2 5 1 6 2 3 4 5 6 5 5 4 1 3 1 3 2 7 5 1 4 2 b. Construct the page replacement table for LRU algorithm and record how many page faults. Fill in the page table after each reference. 3 6 3 4 2 516 2 34 5 6 5 5 4 31 3 2 7 51 42 Construct the page replacement table for 2nd chance algorithm and record how many page faults. Fill the page table after each reference. c. 3 6 3 4 2 51 6 2 34 5 6 5 5 41 31 3 2 7 51 4 2 d. Construct the page replacement table for MFU algorithm and record how many page faults. Show the page table after each reference. 3 6 3 4 2 51 6 2 3 4 56 5 5 4 1 31 3 2 7514 2