How do arrays and linked lists differ in memory layout and access speed?

How do arrays and linked lists differ in memory layout and access speed?

• A. Arrays have non-contiguous memory with dynamic resizing.
• B. Arrays have contiguous memory with constant-time index access; linked lists use nodes dispersed in memory with pointers.
• C. Linked lists have contiguous memory similar to arrays.
• D. Arrays and linked lists have identical memory layouts.

Answer: (B)