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
