Transcription: POP attempts to remove the top element of the stack. If the stack is empty, an exception is thrown. If not, the data in the head of the list is stored and the node at the head of the list is then removed. The value of used is decremented and the data is returned.