Name 1. Consider a reference string: 1 2 3452 4 63157 21133 4 56554324 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. 1 2 345 24 63 15721 1 3 3 456 5 543 2 4 Construct the page replacement table for LRU algorithm and record how many page faults. Fill in the page table after each reference. b. 1 2 34 5 24 63 157 21 133 4565 543 24 c Construct the page replacement table for 2 d chance algorithm and record how many page faults. Fill the page table after each reference. 1 2 3 45 2463 15721 1 3 345 65 5 432 4 d. Construct the page replacement table for MFU algorithm and record how many page faults. Show the page table after each reference. 12 34 5 246315 7 21 13345 655432 4