Consider a direct-mapped cache that has 8 lines, each containing 1 word. For simplicity, assume that a word is 2 bytes long, which means that addresses are also 2 bytes. Are any address bits used to determine the byte within the cache line? If so, how many? Which address bits indicate the line to which that address maps? How many bits are needed for the tag? Consider the following set of memory address requests. How many of the requests would be hits and how many misses, assuming that the cache is empty beforehand? What would be the final contents of the cache? Assume that these 5 data requests are in a loop, and so will be repeated many times in a row. What will the hit rate converge to for this set of requests