A computer system contains a main memory of 32KB. It also has a 1KB cache divided into two-lines/set with 8Bytes per line. Assume that the cache is initially empty. The processor fetches words from locations 1024, 1025, 1026.......1072. and then 2048, 2049, 2050, .... 2096 in that order. It then repeats this fetch sequence two more times. Calculate the Hit ratio and show the state of cache at the end. Assume an LRU is used as replacement algorithm. Estimate the improvement resulting from the use of the cache, if the cache is 20 times faster than RAM. Just comment on relative Hit ratios and Execution times if Fully Associative and Direct Mapping are used here.