Problem $2(20$ points$).$ Suppose we have a direct mapped cache that can hold $2$ blocks with $2$ words per block. Assume that initially the cache is empty. Draw tables to illustrate the state of the cache after each of the following data read operations from the processor:

$1.$ Read word from $0$x$00000000$

$2.$ Read word from $0$x$00000004$

$3.$ Read word from $0$x$00000040$

$4.$ Read word from $0$x$00000020$

The rows in the table should correspond to blocks, with columns for tag, block index, valid, and the

memory addresses of data currently stored in the blocks $($if no data is stored in a block, simply put

dashes$).$ Also, indicate if the processor will stall in order to complete each read operation.