Identify and explain four page replacement methods. Why not critically examine and contrast them?

Please write your answers clearly

II. Page Replacement 1. Assume a computer system has three page frames and demand paging is used. Consider the following page reference string: 3, 2, 4, 3, 5, 1, 6, 3, 4, 2, 6, 3 For this problem, if you could replace any of two (or more) pages at any point in time, choose the lowest-numbered page. a. For the FIFO page-replacement diagram, complete a table like that shown in Table 1. How many page faults occur? Table 1: Page Replacement using FIFO Algorithm Frame # Page Reference String 3 2 4 3 5 1 6 34 263 Frame 1 Frame 2 Frame 3 b. Repeat question II(a) for the optimal page-replacement algorithm, and draw a table for this algorithm. c. Repeat question II (a) for the LRU page-replacement algorithm, and draw a table for this algorithm. For the FIFO page-replacement diagram, complete a table like that shown in Table 1. How many page faults occur?

It is essential to recognize and debate four distinct approaches to page replacement. How about we take a critical look at each of them and compare and contrast them?