Consider a system with a $32-$word D cache between the CPU and

memory. Which of the following is true:

The cache will always improve performance regardless of the data size.

The cache will speed up a linear search if the inner loop is under $32$ words

long.

The cache will always improve performance regardless of the size of the

inner loop.

The cache will not significantly speed up a linear search, regardless of the

data size, because each item is only accessed once.