Which of the following statements is false about a linked list?

A linked list commonly has an auxiliary table of all node-to-node connections. This enables fast retrieval of nodes later on through memoization.

Each node in a linked list has a pointer to the next node in the list. For a doubly linked list, each node also has a pointer to the previous node in the list.

The average time complexity for searching in a linked list isO(n).

The average time complexity for inserting an item at the head of a linked list is O(1).