Assume you're using a computer write a 2-way set associate 32KB cache where writes that miss in the cache are directly written to the next cache hierarchy (i.e. a write-around policy). Assume that the constant N is very large. Fill in the loops in a way that minimizes cache misses. double A[N][N]; double BIN]IN] void foo() int i, j; for(i = 0; i