Which of the following statements about linked lists is correct?

Group of answer choices

Once you have located the correct position, adding elements in the middle of a linked list is inefficient.

Visiting the elements of a linked list in random order is efficient.

When a node is removed, all nodes after the removed node must be moved down.

Linked lists should be used when you know the correct position and need to insert and remove elements efficiently.

Java's LinkedList class is really an interface.