1) Consider a 16-bit processor with a directly mapped cache with 16 Byte cache blocks and 4 entries. Fill out the bitfields in the address map below showing how the address bits are used to lookup a value in the cache. (1 Point) Tag Cache Byte Select Index 15 2) Assume the following address sequence is used to access the cache: 0xA30, OxA32, 0xA3F, 0xA40, 0xA70, OxA4D, 0xA30, OxAOF. Determine whether the accesses hit or miss the cache. Use the cache block size and number of entries as in 1). Fill out the table below. Assume that all cache lines are invalid before the first access. (8 Points) Byte address Block address Tag Cache Index Hit or Miss? (binary) (binary) (hex) 0xA30 0xA32 OxA3F 0xA40 0xA70 OxA4D 0xA30 OxAOF