Exercise 3 m Given that main memory is composed of four page frames for public use, use the following table to answer all parts of this problem: Page Frame Time When Loaded Time When Last Referenced Referenced Bit Modified Bit 0 21 702 0 0 1 130 909 1 1 2 19 820 0 1 3 50 899 1 0 20 What would be the first case of the page to be swapped out by FIFO algorithm? (3.5 Points) ) Page 0 O Page 1 O Page 2 Page 3 21 What would be the 2nd case of the page to be swapped out by FIFO algorithm? (3.5 points) Page 0 O Page 1 Page 2 Page 3 22 What would be the 3rd case of the page to be swapped out by FIFO algorithm? (3.5 points) Page 0 Page 1 Page 2 Page 3 23 What would be the last case of the page to be swapped out by FIFO algorithm? Cum (3.5 points) Page 0 Page 1 Page 2 Page 3 24 What would be the 1st case of the page to be swapped out by LRU algorithm? (3.5 Points) Page 0 Page 1 Page 2 Page 3 25 What would be the 2nd case of the page to be swapped out by LRU algorithm? (3.5 points) Page 0 Page 1 Page 2 O Page 3 26 What would be the 3rd case of the page to be swapped out by LRU algorithm? (3.5 Points) Page 0 Page 1 Page 2 Page 3 27 What would be the last case of the page to be swapped out by LRU algorithm? cm (3.5 Points) Page 0 Page 1 Page 2 Page 3