Write a Python program for the following problem using data structures (Use only Python Programming Language)

Task 1: Transforming an Infix Expression to a Postfix Expression (Contents and images taken from [1) You are given a mathematical expression which contains, numbers, operations +,-, /, * and ^ (power), and opening and closing parentheses. Your task is to convert this infix expression into postfix notation and return the resultant postfix expression as a string. The algorithm for converting a mathematical expression in infix notation to postfix notation is given below. The Basic Infix to Postfix Conversion Algorithm (taken from [1) To convert an infix expression to postfix form, we scan the infix expression from left to right. When we encounter an operand, we place it at the end of the new expression that we are creating. Recall that operands in an infix expression remain in the same order in the corresponding postfix expression. When we encounter an operator, we must save it until we determine where in the output expression it belongs. For example, to convert the infix expression a b, we append a to the initially empty output expression, save t, and append b to the output expression. We now need to retrieve the and put it at the end of the output expression to get the postfix expression a b t. Note Retrieving the operator saved most recently is easy if we have saved it in a stack. In this example, we saved the operator until we processed its second operand. In general, we hold the operator ina stack at least until we compare its precedence with that of the next operator. For example, to convert the expression a +b *c, we append a to the output expression, push +onto a stack, and then append