Python --- Data Structures

Using a [ list ], implement:

STACK - UDT with these functions: top: gets the 'top' of the stack push: puts an element on the top of the stack pop: removes the top element of the stack empty: checks to see if the stack is empty

QUEUE - UDT with these functions: front: gets the front element of a queue back: gets the rear element of a queue enqueue: puts an element on the back of the queue dequeue: removes an element from the front of the queue empty: checks to see if the stack is empty