Consider a $2-$way set associative cache with $4$ sets and a block size of

HW$4\_$CS$250.$pdf $\text{'}$he main memory has a capacity of $128$ bytes. The following

sequence of byte$-$addressed memory accesses occurs:

$0x00,0x08,0x10,0x08,0x20$

Assuming the cache is initially empty and the Least Recently Used

$($LRU$)$ replacement policy is used, determine the number of cache hits

and misses for the given sequence of accesses.

$($a$)$ Fill in the table below to show the cache contents after each access.

Use $\text{'}-\text{'}$ to indicate an empty block.

$($b$)$ Calculate the number of cache hits and misses.