Implement a stack using a singly linked list
L. The operations
POPshould still take $\O(1)$ time.
This is too simple to be worth implementing.
PUSH operation adds an element in the beginning of the list and the
POP operation removes the first element from the list.