Which policy evicts the page that will be accessed furthest in the future?

Group of answer choices

Least$-$Recently$-$Used $($LRU$)$

First$-$In$-$First$-$Out $($FIFO$)$

Random

Optimal $($Belady$\text{'}$s$)$