urgent

6. In a computer system, the memory has 16 blocks and the cache has 4 blocks. Assume there is only one word per block with 4 bytes in one word. The reference sequence in terms of word location is: 3,5,11,12,10,5,8, 15,9,8,5,11. (a) [6%] If the cache is a direct-mapped cache, how many misses do we have if the cache is initially empty? Give the hit or miss sequence for each reference. (b) [6%] If the cache is a fully associative cache, how many misses do we have with LRU replacement policy if the cache is initially empty? Give the hit or miss sequence for each reference. (c) [6\%] If the cache is a two-way set associative cache, how many misses do we have with LRU replacement policy if the cache is initially empty? Give the hit or miss sequence for each reference