1. [Cache Memoryl: A list of 8-bit memory address references given as byte addresses is as follows: 6, 26, 6, 34, 17, 66, 24, 6, 8, 18 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. 1 word = 2 bytes. Only carry out the work assuming 1 word is 2 bytes i.e., no need to do the work assuming word is same as a byte. So there are two cases only: block-based direct mapped and 2-way associative caches