According to the $1$ scpu command run on a Keller Hall $1-262$ machine, the L$1$ cache of a Keller $1-262$

machine is $128$ kilobytes $($where $1$ kilobyte $=1024$ bytes$).$ Assume the cache has a $64-$byte block

size.

Suppose we are running a C program on one of the Keller $1-262$ machines that features an int array

with $262,144$ elements. Assume the array is aligned to the L$1$ cache's block size $($i$.$e$.,$ the array's

starting address is a multiple of $64).$ Our program performs a linear search over the array for a

value that is not stored in the array.

Calculate how many cache misses will occur during this search. You should ignore the loop

variable $($e$.$g$.,,$ as it will be held in a register throughout.

Show your work in the calculating the number of cache misses in the box below $($use descriptions

as necessary, but also include equations$).$

Do we need to know anything about the specific addresses in use here? Explain why or why not.