A $2-$way set associative cache which uses blocks of $8$ bytes is interfaced to the MIPS machine. The cache size is $64$ bytes. The replacement algorithm used is LRU. Knowing that, solve the following:

$1.$ What is the total number of storage bits in the cache including valid bits, dirty bits, tags and cache data?

$2.$ Consider the following sequence of memory accesses, given as byte addresses:

$1692024251225262840293050$

Label each reference in the list as a hit or a miss; show your work clearly, cache is NOT empty initially, as seen below.