Which of the following are true?

Select one or more:

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$.$

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.

c$.$

Since the insertion and deletion operations on a stack are made only at the end of the stack, using an array list to implement a stack is more efficient than a linked list.

d$.$

Since deletions are made at the beginning of the list, it is more efficient to implement a queue using a linked list than an array list.