Why can an array traverse faster than a linked list even though both traversals are O(n)?

Why can an array traverse faster than a linked list even though both traversals are O(n)?

1. Big-O guarantees arrays use fewer CPU instructions.
2. Nearby array slots can have better cache locality than separately allocated nodes.
3. Linked lists must sort nodes during traversal.
4. Arrays always store every language value inline.