Read the slides $($Cache Basics.pdf$)$ posted on the Blackboard and solve the following problem.

Assuming you execute the bubble sort algorithm listed below to sort a $64-$element $($N$=64)$

array on a uni$-$processor; the size of each element is $1$ word; the processor has a cache whose

size is $8$ words; the cache uses direct mapped scheme, first$-$in$-$first$-$out replacement policy,

and write through policy; the cache line size is $2$ words. Compute the cache hit ratio for read

operations when executing the algorithm. Explain.