Say you need a data structure to hold data that will be read continuously in mass, and that the time complexity of using an Array would be the same as a Linked List. You want this read to be as fast as possible. Which data structure would you prefer, and why?

Group of answer choices

Array, because reading continuous data from memory is faster than reading randomly$-$placed data.

It doesn't matter, because the time complexity is the same.

Linked List, because each node can be stored independently from other nodes.

Linked List, because reading from nodes repeatedly is faster than reading a continuous block of memory.

Array, because arrays take less memory.