The loop exchange technique can reduce cache misses. How many misses does each of the following loops have? Assume a direct mapped 64 KiB data cache with 64 bytes blocks, and variables i and j are kept in registers, int is of 32 bits, and x starts at address 128000 (decimal) a direct mapped dy starts at address 126000 int x[5000][128]; /* Loop 1 for (i = 0; 5000; i i+1) /* Loop 2*/ for (i = 0; 5000 ; i = i+1) for (j = 0; j