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

$8$ bytes. The main memory has a capacity of $128$ bytes. The following

sequence of byte$-$addressed memory accesses occurs:

$0$x$00,0$x$08,0$x$10,0$x$08,0$x$20$

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 $-$ to indicate an empty block.

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