Please answer question 8.35

Python 3.0 for language

Comment for each part of line of code explaining what is being done

8.35 A stack is a sequence container type that, like a queue, supports very restrictis methods: All insertions and removals are from one end of the stack, typicly aces the top of the stack. Implement container class Stack that implements cked to a a subclass of object, support the len) overloaded operator, and support the me be referred a stack. It should h push ): Take an item as input and push it on top of the stack pop O: Remove and return the item at the top of the stack isEmptyO: Return True if the stack is empty, False otherwise You should also insure that the stack can be printed as shown. A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed. >>S Stack( >>>s.push ('plate 1') >>>s.push('plate 2') >>>S.push ('plate 3') ['plate 1', 'plate 2', 'plate 3'] >>> len (s) >>>s.pop () 'plate 3' >>>S.pop () plate 2 >>>s.pop ) 'plate 1 >>>s.isEmpty True