A) examine the code given below to compute the average of an array: total = 0; for(j=0; j < k; j++) { sub_total = 0; /* nested loops to avoid overflow */ for(i=0; i < n; i++) sub_total += a[j*n + i]; total += sub_total/n; } average = total/k; when designing a cache to run this application, given a constant cache capacity and associativity, will you want a larger or smaller block size? why?