Python Question:

A stack follows LIFO (last-in, first-out). LIFO is the case where the last element added is the first element that can be retrieved. Consider a list with values [4,6,9]. Create a class called Sclass with functions sadd and sretrieve to add and pop elements from the list in LIFO order respectively. After each function call, print the contents of the list. Add 12 to the stack and then follow the LIFO rules and pop elements until the list is empty.