Cache operation Suppose we are using the cache in Problem 2. Starting from power on, the following byte addresses (in decimal) are recorded in cache references. 1,4, 16, 132, 232, 128, 1024, 30, 140, 3100, 228, 2180. First, construct on paper a table like following one. Then answer the questions. Address Tag Miss/Hit Binary Addr. 000 00000 0001 O 000 00000 0100 O Index M H Cache update Block 0 = bytes 0..15 O O 4 16 ... Fill in the following blanks with integers. After accessing address 1, bytes from address 0 to address 15 are loaded in cache block O. After accessing address 16, bytes from address to address are loaded in cache block After accessing address 132, bytes from address to address are loaded in cache block After accessing address 232, bytes from address to address are loaded in cache block There are hits out of the 12 memory accesses (and you can calculate the hit rate). Cache operation Suppose we are using the cache in Problem 2. Starting from power on, the following byte addresses (in decimal) are recorded in cache references. 1,4, 16, 132, 232, 128, 1024, 30, 140, 3100, 228, 2180. First, construct on paper a table like following one. Then answer the questions. Address Tag Miss/Hit Binary Addr. 000 00000 0001 O 000 00000 0100 O Index M H Cache update Block 0 = bytes 0..15 O O 4 16 ... Fill in the following blanks with integers. After accessing address 1, bytes from address 0 to address 15 are loaded in cache block O. After accessing address 16, bytes from address to address are loaded in cache block After accessing address 132, bytes from address to address are loaded in cache block After accessing address 232, bytes from address to address are loaded in cache block There are hits out of the 12 memory accesses (and you can calculate the hit rate)