Q3 Associative Caches 5 Points Q3.1 3 Points Consider a hypothetical machine that implements a set-associative cache. Each set in the cache consists of 8 lines, and each cache line holds 4 bytes of data. The cache can store 16 Kbytes of data. The main memory is byte-addressable and can store 2 Mbytes of data. How is the memory address divided into tag, set number and byte number, giving, respectively, the number of bits for each? Provide your answers in Base 10 numbers (and only write down the number). The most significant bits are used for the tag. the middle bits are used for the set number. and the least significant bits are used for the byte number. 2 Points Consider now a fully associative cache where each cache line holds 8 machine words (i.e., the basic addressable unit). The machine word size is 4 bytes. The cache can store 32 Kbytes of data, and the main memory can store 1 Mbytes of data. How many bits of a memory address should be used for the tag? Provide your answers in Base 10 numbers (and only write down the number). Enter your answer here