A circular queue is a type of queue where the last position is connected back to the first position, forming a circle. Which of the following statements is TRUE about a circular queue?

A circular queue can store a maximum of $n-1$ elements, where $n$ is the size of the underlying array.

A circular queue can store a maximum of $n$ elements, where $n$ is the size of the underlying array.

A circular queue is a type of linked list, and does not use an underlying array.

A circular queue can store an unlimited number of elements, as long as the underlying array is dynamically allocated.