Which of the following statements about queues are true? $($NOTE: this question is not about priority queues or double$-$ended queues.$)$:

$-$All queue operations other than isEmpty$()$ are O$($n$)$

$-$In a circular array implementation of a queue the enqueue$()$ and dequeue$()$ operations may have O$(1)$ complexity, but capacity is limited by the size of the array

$-$A queue can be viewed as a special type of list, where the elements are inserted into the end $($tail$)$ of the queue, and are retrieved and deleted from the beginning $($head$)$ of the queue.

$-$While a queue may be implemented using an array, enqueue$()$ and dequeue$()$ operations of such implementation will neccessarily be O$($n$)$

$-$It is possible to implement a queue using a singly linked list with tail reference for storage and achieve O$(1)$ complexity for enqueue$()$ and dequeue$()$ operations