For the given code snippets, predict the cache hit rate. The cache is $16$ KiB $,$ direct

mapped, and has $128-$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:

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

the cache is empty before the loops start executing.

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

$//$ Version v$1$

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

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

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

$\}$

$\}$

$//$ Version v$2$

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

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

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

$\}$

$\}$

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

Available options are $0,15/16,$ or $1/2$

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

Available options are $0,15/16,$ or $1/2$