$2.$ Suppose that we have a multiword $4-$way set associative cache with $4$ lines $($blocks$)$ that stores four words per block. Assume that $8-$bit memory addresses are used. If the cache is initially empty, draw a representation of the cache after the following memory accesses $($i$.$e$.,1$ drawing total$)$ including tags and valid bit values. You can represent the contents of a cache block by using a notation such as $[00000000]$ to indicate that the value stored is the contents of the memory address $00000000.$ You only need to show a single drawing that represents the state of the cache after all of the accesses listed. Assume that the cache uses a FIFO replacement policy.

$00000010$

$01001001$

$01101010$

$00000000$

$11111100$

$00111001$

$10010011$

$00000011$

$10001101$

$10101001$

$01101010$

$01010101$

$11110000$

$01001000$

$10001010$

$00000001$

$00101011$

$00001101$

$11000000$