Caching $2$ limited$,$ strategies are employed to determine what is in the cache and when it should be replaced. These are referred to as eviction policies and replacement policies. Which of the following are true?

Pick ONE OR MORE Options

A cache hit is a situation when the cache becomes full.

LRU and MRU are eviction policies that respectively discard least recently used and most recently used elements from the cache to make space for other elements. In applications like social networks with feed, LRU, in general, performs significantly better than MRU.

If the future is known, it is pqifible to design an eviction policy that is optimal.

The data in a cache is always consistent with the changes made to it$.$ Any time it is requested, the most recent version is returned.

Clear Selection