Below is a sequence of twelve $32-$bit memory address references given as word addresses. $1,18,2,3,4,20,5,21,33,34,1,4.$ Note that word and byte addresses are different. The word address appended by offset $($two zeros$)$ gives you the byte address. In other words, word addresses are multiples of $4.$ For example, if the word address is $1,$ the equivalent byte address is $4(100)\mathrm{.}1\mathrm{.}2\mathrm{.}1\mathrm{.}2$Assuming a direct$-$mapped cache with one$-$word blocks and a total size of $16$ blocks, list if each reference is a hit or a miss assuming the cache is initially filled with word address $0,1,2,...15$ memory data. Show the state of the cache after the last reference. Calculate the hit rate for this reference string.