Imagine a hypothetical cache that uses the high-order s bits of an address as the set index. For such a cache, contiguous chunks of memory blocks are mapped to the same cache set.

A. How many blocks are in each of these contiguous array chunks? 

B. Consider the following code that runs on a system with a cache of the form (S, E, B, m) = (512, 1, 32, 32):

What is the maximum number of array blocks that are stored in the cache at any point in time?

int array [4096]; for (i = 0; i < 4096; i++) sum += array[i];