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 in order: 1024, 1025, 2048, 2049 2050, 4096, 4097, 1026, 2051 2052, 4098 in that order. Assume an LRU is used as replacement algorithm. Calculate the Hit ratio. Show the state of cache at the end. How many blocks are replaced? Estimate the improvement resulting from the use of the cache, if the cache is 10 times faster than RAM. Just comment relative Hit Ratio and execution time if 4-way set associative cache is used instead