It pertains to profiling cache memory requests.

$1.(4$ points$)$ Align the following memory address to $64$ bytes: $0$xABCD.

$2.(4$ points$)$ A system has $48$ bit virtual memory addresses, a word size of $2$ bytes and cache

blocks of $64$ words. If a cache has $8$ rows, how large is the tag?

$3.(8$ points$)$ Profile the following memory requests for a single layer direct$-$mapped cache. The system has $16$ bits for virtual memory addresses, and a block size of $8$ bytes. Assume that these requests are all loads$/$reads and you do not need to note if a block is dirty. The cache has $4$ rows.

$($a$)0$b$1110101101010100$

$($b$)0$b$1010110110100100$

$($c$)0$b$1010101011101100$

$($d$)0$b$1010101010101100$

$($e$)0$b$1010101011111100$

$($f$)0$b$1010101010100100$

For each request above note if it was a miss or hit, the type of miss $($if relevant$).$ Give the final state of the cache after the last request.