2. (30 points) a. Repeat the same problem for the following table, assuming write-back and no write-allocate are used. Also, assume the cache is 2-way set-associative and the replacement algorithm is LRU. Note: At each set access (whether read or write) both blocks must be shown In part a, how many cache misses are there? b. 2. (30 points) a. Repeat the same problem for the following table, assuming write-back and no write-allocate are used. Also, assume the cache is 2-way set-associative and the replacement algorithm is LRU. Note: At each set access (whether read or write) both blocks must be shown In part a, how many cache misses are there? b