ENG 3531 Computer Architecture Fall 2017 . (8 pt) Assuming that a 2-way set associative cache uses 34-bit memory address (15 bit for tag,9 bit for index, 10 bit for byte offset), calculate the followings: Size of data field in each block Number of blocks in cache : Total size of useful data in cache : Number of tag comparisons done in parallel: s. (8 pt) Assume that a two-way set associative cache has a total of 8 blocks and each block holds 1 byte of data. For the following memory references, determine the final content of the cache for LRU replacement policy. You can assume that the cache is initially empty. Memory addresses are given in decimal. Memory References: 0, 1, 5, 10, 23, 34, 28, 1, 21, 28, 36, 10, 18 Block # | Final Content