3. [21 marks] Consider a computer with a byte-addressable memory. A 40-bit memory address is divided as follows for cache processing. First, the 8 low-order bits are chopped off to expose the cache-line number. Second, the next 17 low-order bits are inspected to get the cache-container index. Third, the remaining 15 bits are used as the cache tag. Hint: What do the direct-mapped and set-associative placement formulas have in common? a) [7 marks] What is the cache size in bytes? b) [7 marks] What is the cache-mapping scheme? c) [7 marks] For a given byte in the cache, how many different bytes in the main memory could possibly be mapped to it?