1. [100] A list of 8-bit memory address references given as word addresses is as follows 2, 44, 6, 214, 175, 1, 212, 6, 25, 17 For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 16 1-word blocks. Also, list if each reference is a hit or a miss assuming that the cache is initially empty. Also, work through the exercise for a 2-way associative cache of size 16 1-word blocks. Block size is same as word size should be taken as 1 byte and 4 bytes to solve the problem in two different contexts as discussed in the class. There are four parts of the problem: 1. Direct-mapped cache and block size 1 byte. Memory addresses are byte addresses and block addresses are the same. There are no offset bits. 2. Direct-mapped cache and block size but block addresses are values obtained after applying the floor function to the result of dividing the byte addresses by 4. There are offset bits needed to locate the byte within the block as a block of data (4 bytes) is transferred from main memory to the cache. 4 byte. Memory addresses are byte addresses, 3. 2-way associative cache and block size 1 byte. Memory addresses are byte addresses and you need set addresses to index into the cache. There are no offset bits 4. 2-way associative cache and block size- 4 byte. Memory addresses are byte addresses, but set addresses are values obtained after applying the floor function to the result of dividing the byte addresses by the number of sets. There are offset bits needed to locate the byte within the block as a block of data (4 bytes) is transferred from main memory to the cache