Consider a program that frequently accesses a large data collection. Which approach to memory layout and access would likely yield the best performance?
a. Storing the data collection in a sequential manner and accessing it sequentially to leverage cache lines.
b. Storing the data collection sequentially but accessing it in a random order.
c. Storing the data collection randomly in memory and accessing it sequentially.
d. Frequently clearing the CPU cache to ensure fresh data access.