Final answer:
The implementation of the LFU and the MFU algorithm is very uncommon because they are expensive (Option C).
Step-by-step explanation:
The implementation of the Least Frequently Used (LFU) and the Most Frequently Used (MFU) algorithms is very uncommon because they are considered expensive in terms of computational resources. Both of these caching algorithms require keeping track of the frequency of access for the items stored in the cache, which can be resource-intensive. LFU removes the item that has been accessed least frequently when making room for new content, while MFU removes the one accessed most frequently, under the assumption that an item accessed frequently in the past will not be accessed again in the near future.
The computational overhead for maintaining access counters and constantly sorting items based on these counters can hinder the performance and scalability of systems employing the LFU or MFU page replacement algorithms as compared to simpler methods such as Least Recently Used (LRU).
Thus, the correct choice from the options is c) they are expensive.