GIVE EXPLANATION OF THE ANSWER!

Which of the following are true about the implementation for the array-based queue explain why!

Select one or more:

If the end of the queue is in the last position of the underlying list, then enqueue() will allocate a new double-sized list only when the current list is full.

If the end of the queue is in the last position of the underlying list, then enqueue() will allocate a double sized list immediately.

To remove an item from the queue, we only need to set the front to the next element in the queue None.

The array-based queue is implemented with the underlying storage in a list, And this list is used in a circular fashion to make better use of memory space.

GIVE EXPLANATION OF THE ANSWER

Which of the following is true about the implementation of enqueue() in array based queue?

The last position of the underlying list has been used indicates that the queue is full.

The last position of the underlying list has been used does not indicate that the queue is full.