Given a fully associative cache with $16$ blocks, and block size$=8$ words. The number of cache misses in the following loop when i $=0($implemented in C language$)$

int A$[8][8],$ B$[8][8],$ C$[8][8]$;

for$($int i$=0$; i$<8$;i$++)$

for$($int j$=0$; j$<8$;j$++)$

for$($int k$=0$;k$<8$;k$++)$

A$[$i$][$j$]+=$B$[$i$][$k$]*$C$[$k$][$j$]$

a$)3$

b$)8$

c$)10$

d$)16$

e$)64$