This algorithm removes a page at random from the lowest$-$numbered nonempty class. Implicit in this algorithm is the idea that it is better to remove a modified page that has not been referenced in at least one clock tick.

Group of answer choices

Optimal page replacement algorithm

Not Recently Used page replacement algorithm

First$-$In$,$ First$-$Out $($FIFO$)$ page replacement algorithm

Least Recently Used $($LRU$)$ page replacement algorithm