Among page replacement algorithms, which one is considered good and efficient?

$($Chapter $3)$

LRU $($Least Recently Used$)$

FIFO $($First$-$In$,$ First$-$out$)$

Clock

NFU $($Not Frequently Used$)$

Second chnce

Working set clock

Working set

Optimal