$/*$ Before $*/$

for $($k $=0$; k $<mtext></mtext><mn>1</mn><mn>0</mn><mn>0</mn>$; k $=$ k$+1)$

for $($j$=0$;j$<mn>1</mn><mn>0</mn><mn>0</mn>$; j$=$ j$+1)$

for $($i $=0$;i;i$=$i$=1)$

x$[$i$][$j$]=2**[$i$][$j$]$;

$/*$ After $*/$

for $($k $=0$; k$<mtext></mtext><mn>1</mn><mn>0</mn><mn>0</mn>$; k $=$ k$+1)$

for $($i $=0$; i; i$=1+1)$

for $($j$=0$;j$<mn>1</mn><mn>0</mn><mn>0</mn>$;j$=$j$+1)$

In the provided code snippet, the $j$ and i loops in the before code are interchanged in

the after code. How does this loop interchange benefit cache performance?

It reduces the number of loop iterations

It improves temporal locality

It improves spatial locality

It reduces the number of conflict misses

It reduces the required cache size