consider the following code,

#define N 4096

int A[N], B[N];

int i;

.

.

for(i = 0; i < N; i++)

A[i] = A[i] + B[i];

.

Assume that in the system the main memory address is 32 bits and having 2-way set associative cache with 16 bytes per block, set field of 8 bits and having LRU replacement policy. initially cache is empty.

also assume that A and B are aligned to a 4KB boundary and are contiguous in main memory. integers are 32bits.

what is miss rate for 2-way set associative cache for running the above for loop code?