For the given code snippets, predict the cache hit rate. The cache is $8$KB$,$ direct mapped, and has $64-$byte cache lines. There are two implementations for the for loops $($v$1$ and v$2)$ which are executed separately in isolation. Assume that the:

$1$long variables total$\_$sum and array arr are doublewords

$2$the cache is empty before the loops start executing.

$3$f you need any other assumptions to solve this question, state them in your answer.

$//$ Version v$1$

for$($int i$=0$; i$<256$; i$++)\{$

for $($int j$=0$; j$<256$; j$++)\{$

total$\_$sum $+=$ arr$[$i$][$j$]$;

$\}$

$\}$

$//$ Version v$2$

for$($int i$=0$; i$<256$; i$++)\{$

for $($int j$=0$; j$<256$; j$++)\{$

total$\_$sum $+=$ arr$[$j$][$i$]$;

$\}$

What is the cache hit rate in Version v$1?$

What is the cache hit rate in Version v$2?$