In this exercise, we will examine how replacement policies impact miss rate. Assume a 2-way set associative cache with 4 blocks. To solve the problems in this exercise, you may find it helpful to draw a table like the one below, as demonstrated for the address sequence “0, 1, 2, 3, 4.”Consider the following address sequence: 0, 2, 4, 8, 10, 12, 14, 8, 0.1. Assuming an LRU replacement policy, how many hits does this address sequence exhibit? Please show the status of the cache after each address is accessed. 2. Assuming an MRU (most recently used) replacement policy, how many hits does this address sequence exhibit? Please show the status of the cache after each address is accessed. ### Cache Memory Access TableThe table below illustrates the process of accessing memory blocks and their effect on cache memory.#### Table Explanation:- **Columns:** - **Address of Memory Block Accessed**: Indicates the specific memory block being accessed. - **Hit or Miss**: Shows whether the memory access resulted in a hit or a miss. - **Evicted Block**: Displays the block that was evicted from the cache, if applicable. - **Contents of Cache Blocks After Reference**: Describes the state of the cache after the memory access under `Set 0` and `Set 1`.| Address of Memory Block Accessed | Hit or Miss | Evicted Block | Set 0 | Set 0 | Set 1 | Set 1 ||----------------------------------|-------------|---------------|-------|-------|-------|-------|| 0 | Miss | | Mem[0]| | | || 1 | Miss | | Mem[0]| | Mem[1]| || 2 | Miss | | Mem[0]| Mem[2]| Mem[1]| || 3 | Miss | | Mem[0]| Mem[2]| Mem[1]| Mem[3]|| 4 | Miss | 0 | Mem[4]| Mem[2]| Mem[1]| Mem[3]|| ... | | | | | | |#### Graph/Diagram Explanation:- **Cache States**: - The entries under each set (Set 0 and Set 1) represent the specific memory blocks currently occupying the respective cache lines. - In the event of a miss, if necessary, the least recently used block is evicted to make space for the new memory block. The evicted block is noted in the "Evicted Block" column. This table is an excellent resource for understanding how cache replacement policies work and how they impact memory access efficiency.

In LRU or Least Recently Used algorithm, the least recently used item is discarded first. MRU or Most Recently Used algorithm is the opposite of the LRU algorithm. In MRU, the most recently used item is discarded first. 2 way set associative cache means each set contains 2 blocks. Number of sets=4÷2=2 The address sequence: 0, 2, 4, 8, 10, 12, 14, 8, 0 Set Number= (Main Memory Block Number) MOD (Number of sets in cache) Set Number for 0=0MOD2=0 Set Number for 2=2MOD2=0 Set Number for 4=4MOD2=0 Set Number for 8=8MOD2=0 Set Number for 10=10MOD2=0 Set Number for 12=12MOD2=0 Set Number for 14=14MOD2=01. LRU replacement policy Address of Memory Block accessed Hit or Miss Evicted Block Set0 Set0 Set1 Set1 0 Miss Mem[0] 2 Miss Mem[0] Mem[2] 4 Miss 0 Mem[4] Mem[2] 8 Miss 2 Mem[4] Mem[8] 10 Miss 4 Mem[10] Mem[8] 12 Miss 8 Mem[10] Mem[12] 14 Miss 10 Mem[14] Mem[12] 8 Miss 12 Mem[14] Mem[8] 0 Miss 14 Mem[0] Mem[8] The number of hits in LRU replacement policy=0 2. MRU replacement policy Address of Memory Block accessed Hit or Miss Evicted Block Set0 Set0 Set1 Set1 0 Miss Mem[0] 2 Miss Mem[0] Mem[2] 4 Miss 2 Mem[0] Mem[4] 8 Miss 4 Mem[0] Mem[8] 10 Miss 8 Mem[0] Mem[10] 12 Miss 10 Mem[0] Mem[12] 14 Miss 12 Mem[0] Mem[14] 8 Miss 14 Mem[0] Mem[8] 0 Hit Mem[0] Mem[8] The number of hits in MRU replacement policy=1.