A computer system's main memory consists of 64K 64-bit words, and a two-way set-associative cache consists of 64 word-sized lines and has a total size of 512 words. Also, suppose that the cache is operated in an LRU manner and the time it takes to read a block from the main memory is 10 times the time it takes to read a block from the cache. When the cache is empty, the processor is 40h, 41h, 42h, ..., If you repeat accessing word 27Fh 10 times in order, how much faster is using the cache compared to not using the cache?