Which of the following are true? Please select all that apply.

A$)$A stack can be viewed as a special type of list, where the elements are accessed, inserted, and deleted only from the end, called the top, of the stack.

B$)$Since deletions are made at the beginning of the list, it is more efficient to implement a queue using a LinkedList than an ArrayList.

C$)$Since the insertion and deletion operations on a stack are made only at the end of the stack, you can use either an ArrayList or a LinkedList. However, ArrayList has less overhead than LinkedList.

D$)$A queue represents a waiting list. 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 accessed and deleted from the beginning $($head$)$ of the queue.