Consider the following page-replacement algorithms. Rank these algorithms on a five-point scale from bad to perfect according to their page-fault rate. Separate those algorithms that suffer from Belady's anomaly from those that do not.

• a. LRU replacement
• b. FIFO replacement
• c. Optimal replacement
• d. Second-chance replacement

10.24 Apply the (1) FIFO, (2) LRU, and (3) optimal (OPT) replacement algorithms for the following page-reference strings:

• 2,6,9,2,4,2,1,7,3,0,5,2,1,2,9,5,7,3,8,5
• 0,6,3,0,2,6,3,5,2,4,1,3,0,6,1,4,2,3,5,7
• 3,1,4,2,5,4,1,3,5,2,0,1,1,0,2,3,4,5,0,1
• 4,2,1,7,9,8,3,5,2,6,8,1,0,7,2,4,1,3,5,8
• 0,1,2,3,4,4,3,2,1,0,0,1,2,3,4,4,3,2,1,0

Indicate the number of page faults for each algorithm assuming demand paging with three frames.