Consider the following C code. int a$[1024],$ b$[1024],$ c$[1024],$ d$[1024]$; void main$()\{$ int s$=0$; for$($int i$=0$; i$<1024$; $++$i$)\{$ s $+=$ a$[$i$]*$b$[$i$]+$c$[$i$]*$d$[$i$]$; $\}\}$ Assume that the starting addresses of a$,$ b$,$ c$,$ d are $0$x$0000,0$x$1000,0$x$2000,$ and $0$x$3000,$ respectively. $($a$)(10$pt$)$ Consider a direct mapped cache which has $8$ blocks and the block size is $16-$word. Compute the data cache miss rate for the above program. $($b$)(10$pt$)$ For the above program, what is the minimal associativity to minimize the conflict cache misses. And for the revised cache, what is the data cache miss rate? $($c$)(10$pt$)$ Change the program to improve the cache hit rate by splitting the for$-$loop and write the revised program. In addition, for the same cache $(16$ word block size$)$ in $($a$),$ compute the data cache miss rate.