(2 points each) Let (a) wordl and word2 be in the same cache line fetched from block_x in the main memory, (b) word3 be in block_y immediately following block_x, and (c) word4 be in a block z far away from block_x and block_y. The system uses a dynamic block prediction algorithm to predict which block is likely to be accessed very soon and perfetches the predicted block. The algorithm predicts that one or more words in the block immediately following the block currently being fetched (of course due to a read/write miss) will be needed soon. It is assumed that copying a block from the main memory to the cache finishes before the next memory reference. The following questions are independent of each other. 2.a Assume wordl is currently accessed. Which word can take the advantage of temporal locality? i. word1 11, word2 iii. word3 iv. word4 v. no word 2.b Assume word2 is currently accessed. Which word can take the advantage of spatial locality? i. wordl ii. word2 iii. word3 iv. word4 v. no word 2.c Assume word4 is currently accessed. Which word can take the advantage of spatial locality? i. word1 ii. word2 111, word3 iv. word4 v. not word1 nor word2 nor word3 nor word4 2.d Assume word4 is currently accessed. Which word can take the advantage of temporal locality? i. word1 ii. word2 iii. word3 iv. word4 not word1 nor word2 nor word3 nor word4 v. 2.e Assume word1 is read and word2 is written. How many misses are there? i. 1 miss ii. 2 misses ii. 3 misses iv. no miss Assume word2 is read and word3 is written. How many misses are there? i. 1 miss ii. 2 misses 2.f ii. 3 misses iv. no miss