Consider a computer with a data cache block size of 64 bytes and a word size of 4 bytes. The memory takes 10 cycles to supply the first word and 2 cycles for the rest of the block. This caches and memory system implement a "Requested word first and early restart" policy, the bus (32-bit wide) delivers the block data in cyclic order starting with the requested word. Cyclic order means that if the requested word is the 5th in a block of size 16 words, then the order in which the words in the block Part A Consider the following code fragment, which operates on an integer array A which is block aligned (that is A[0] is located at the starting of a cache block in memory) 1. For (i-11; iK100;i+-16) Suppose that the cache is big enough so that there are only compulsory misses. Further statement 1 takes 4 cycles to execute, statement 2 takes 4 cycles to execute in addition to any miss latency. Assume no overlap in the execution in these statements> initially the array A is not present in the cache, so any initial accesses to A cause misses in the cache. (please see start and increments of the loop), What is the running time of this loop with the "requested word first and early restart" policy? Part B How many cycles would the above loop take to run in a system with just "Early Restart"i.e. the block is fetched in normal order, but the program is started early at arrival of requested word). Part C. How many cycles would the above loop make to run in a system with the base policy? Consider a computer with a data cache block size of 64 bytes and a word size of 4 bytes. The memory takes 10 cycles to supply the first word and 2 cycles for the rest of the block. This caches and memory system implement a "Requested word first and early restart" policy, the bus (32-bit wide) delivers the block data in cyclic order starting with the requested word. Cyclic order means that if the requested word is the 5th in a block of size 16 words, then the order in which the words in the block Part A Consider the following code fragment, which operates on an integer array A which is block aligned (that is A[0] is located at the starting of a cache block in memory) 1. For (i-11; iK100;i+-16) Suppose that the cache is big enough so that there are only compulsory misses. Further statement 1 takes 4 cycles to execute, statement 2 takes 4 cycles to execute in addition to any miss latency. Assume no overlap in the execution in these statements> initially the array A is not present in the cache, so any initial accesses to A cause misses in the cache. (please see start and increments of the loop), What is the running time of this loop with the "requested word first and early restart" policy? Part B How many cycles would the above loop take to run in a system with just "Early Restart"i.e. the block is fetched in normal order, but the program is started early at arrival of requested word). Part C. How many cycles would the above loop make to run in a system with the base policy