(Solved): An implementation of the Stack ADT is shown in the answer box for this question. Extend the Stack ...

An implementation of the Stack ADT is shown in the answer box for this question. Extend the Stack implementation by adding Exception handling. Exceptions are raised when preconditions are violated. For example, an IndexError will be raised if a program attempts to pop/peek from an empty stack. You should modify the pop() and peek() methods of the Stack class to raise an IndexError with the error message "ERROR: The stack is empty!" if an attempt is made to pop/peek from an empty stack. Submit the entire Stack class definition in your answer to this question. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. For example: Answer: (penalty regime: \( 0,0,5,10,15,20,25,30,35,40,45,50 \% \) ) def is_empty(self): return self.items \( ==[] \) def push(self, item): self.items. append(item) def pop(self): return self.items.pop() def peek(self): return self.items [-1] def size(self): return len(self.items) Continuing on with your Stack class implementation from the previous exercise, extend the definition of the Stack class by implementing the following two additional methods: - The _str__(self) method that returns a string representation of the object formatted as in the examples below (ordinarily, we don't view items on a stack other than the top item, but this method will allows us to visualise the entire stack). This string should consist of the character '[', followed by items on the stack separated by commas, followed by a space, followed by an arrow ('<-'). For example, the following code fragment: my_stack \( = \) Stack() my_stack.push('a') my_stack.push('b') print(my_stack) produces: \[ \text { ['a', ' } b^{\prime}<- \] where \( b \) is the top element in the stack. - The clear(self) method that clears the stack (i.e. removes all of the items). Submit the entire Stack class definition in the answer box below. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. Continuing on with your Stack class implementation from the previous exercise, extend the Stack class by adding the multi_push (self, numbers, how_many) method which takes a list of code fragment: my_stack \( = \) Stack () numbers \( =[1,2] \) my_stack.multi_push(numbers, 3) print(my_stack) produces: \[ [1,2,1,2,1,2<- \] Note: - Submit the entire Stack class definition in the answer box below. - You can assume that the parameter list is not empty and the how_many parameter is \( >0 \). - Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. Continuing on with your Stack class implementation from the previous exercise, extend the Stack class by adding the multi_pop (self, number) method. This method takes an integer as a parameter and pops the corresponding number of elements from the stack. The method should return those popped elements as a Python list. For example, the following code \( s=s \operatorname{tack}() \) 5. push (100) 5. push (101) 5. push (102) print(s.multi_pop(3)) produces: \( [102,101,100] \) If the stack contains enough elements for the multi-pop() operation to succeed, then the function should return the list. However, if there are not enough elements on the stack for the Submit the entire Stack class definition in the answer box below. You can assume that the parameter is a valid integer. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks.