Which of the following regarding Linked Lists are false?

Group of answer choices

Random Access can be done in O$($n$)$ time

Appending to the end of a linked list $($with no tail pointer$)$ will takes O$($n$)$ time

One way that you can keep track of the number of elements in a linked list is having a size variable

Linked lists are allocated in a single chunk of contiguous memory