The LRU replacement policy is based on the assumption that if address A1 is accessed less recently than A2 in the past, then A2 will be accessed again before A1 in the future. Hence, A2 is given priority over A1. Discuss how this assumption fails to hold when a loop larger than the instruction cache is being continuously executed. For example, consider a fully associative 128-byte instruction cache with a 4- byte block (every block can hold exactly one instruction). The cache uses an LRU replacement policy.