For this problem you will practice cache lookups. In this example, addresses are $13$ bits wide, the cache is a $2-$way set associative, with a $4$ byte block size, and $16$ total lines. The content of the cache is shown below.

Q$1$:

We are going to access the memory at address $0$x$0$E$34.$

What is the $0$x$0$E$34$ in binary? Make sure your answer is a $13-$bit number.

Q$2$:

What is the block offset for $0$x$0$E$34?$

Q$3$:

What is the set index for $0$x$0$E$34?$

Q$4$:

What is the cache tag for $0$x$0$E$34?$ Give your answer in hexadecimal without the leading $0$x$.$

Q$5$:

Is memory address $0$x$0$E$34$ in the cache? In other words, do we get a cache hit?

Q$6$:

If we got a cache hit, what is the byte returned? Give your answer in hexadecimal without the leading $0$x$.$ If we got a cache miss, put $0$ as your answer.