Which of the following statements about stacks are true?

Group of answer choices

It is possible to implement a stack using a singly linked list with only the head reference for storage and achieve O$(1)$ complexity for push$()$ and pop$()$ operations

Only stacks implemented using linked lists have unlimited capacity

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

All stack operations other than isEmpty$()$ are O$($n$)$

While a stack may be implemented using a linked list, pop$()$ and push$()$ operations of such implementations will not be able to execute in constant time. $($In other words, the time to perform pop$()$ and push$()$ will grow as the size of the stack grows.$)$