What makes implementing a queue with a Linked List potentially easier than implementing a queue with a typical array?

Group of answer choices

There's no need to use a temporary variable for returning a dequeued item after removing it from the queue, as there would be in an array.

There's no need to explicitly shift the elements of a LinkedList to the front, as there would be in an array.

There's no need to keep track of how many elements are present, as there would be in an array.

There is no advantage to using a LinkedList implementation over an array implementation.

There's no need to keep track of a front and a back, as there would be in an array.