2. (17 pts) Repeat Question 1 but assume we have a fully associative cache with one- word block and a total size of 8 blocks. Use LRU replacement. a. Explain how a 32-bit address should be divided into Tag and Offset fields. b. For the same byte-address sequence, fill in the table below Address Binary Tag Hit/Miss Replacement? LRU order pattern 0x018 0x218 0x2FC 0x218 0x018 0x246 0x180 0x241 0x247 0x219 Note: you must use decimal values for Tag. LRU order should list all blocks in cache, represented by their Tags, from most recent to least recent. 2. (17 pts) Repeat Question 1 but assume we have a fully associative cache with one- word block and a total size of 8 blocks. Use LRU replacement. a. Explain how a 32-bit address should be divided into Tag and Offset fields. b. For the same byte-address sequence, fill in the table below Address Binary Tag Hit/Miss Replacement? LRU order pattern 0x018 0x218 0x2FC 0x218 0x018 0x246 0x180 0x241 0x247 0x219 Note: you must use decimal values for Tag. LRU order should list all blocks in cache, represented by their Tags, from most recent to least recent