$6\mathrm{.}40$

Given the assumptions in Problem $6\mathrm{.}38,$ determine the cache performance of the

following code:

$1$ for $($i $=15$; i $>=0$; i$--)\{$

$2$ for $($j $=15$; j $>=0$; j$--)\{$

$3$ square$[$i$][$j$].$y $=1$;

$4\}$

$5\}$

$6$ for $($i $=15$; i $>=0$; i$--)\{$

$7$ for $($j $=15$; j $>=0$; j$--)\{$

$8$ square$[$i$][$j$].$c $=0$;

$9$ square$[$i$][$j$].$m $=0$;

$10$ square$[$i$][$j$].$k $=0$;

$11\}$

$12\}$

A$.$ What is the total number of writes?

B$.$ What is the total number of writes that hit in the cache?

C$.$ What is the hit rate?