It is observed in the following code that each iteration requires two loads (a[i], then a[i+1024]) and a store (a[i]), and the cache hit rate on the store is 0% due to conflict misses. Tell me everything you can conclude about the cache. uint32_t a [MAX]; for (i=0; i