Answer the following statements true (T) or false (F)

1. If you use a linear chain with only a head pointer to implement a queue, the enqueue operation will have efficiency O(1).
2. In the class LinkedQueue, the addition of an item to an empty queue is treated as a special case.
3. A circular linked chain cannot represent a queue.
4. The nodes in a circular chain have next pointers that never contain nullptr.
Shifting to avoid rightward drift works well and is efficient.
5. Shifting to avoid rightward drift works well and is efficient.

1. False
2. True
3. False
4. True
5. False