The least recently used (LRU) replacement policy is only one of many cache block replacement policies for multi-way associative caches. Some other replacement policies include first-in-first-out (FIFO) replacement and random (RAND) replacement. FIFO replacement evicts the block that has been there the longest, regardless of how recently it was accessed. Random replacement randomly picks a block to evict. Discuss the advantages and disadvantages of each of these replacement policies. The least recently used (LRU) replacement policy is only one of many cache block replacement policies for multi-way associative caches. Some other replacement policies include first-in-first-out (FIFO) replacement and random (RAND) replacement. FIFO replacement evicts the block that has been there the longest, regardless of how recently it was accessed. Random replacement randomly picks a block to evict. Discuss the advantages and disadvantages of each of these replacement policies