If there are multiple frames that can be replaced at the same time, the priority is from top to bottom.

1.FIFO(First in First Out)

algorithm 2. Optimal algorithm 3. LRU(Least Recently Used) algorithm

There is a computer with 3 frames, and the page access srquence is 1,2,3,4,1,2,5,1,2,3,4,5 Frume Draw it in the table format above. In addition ploase circle the frame where page fault accurs. for exumple: 2 trames, 2,1,2,3 frame