Python3 code for converting infix to postfix and prefix to postfix!!!! Helppppp!

Converting Infix Expressions to Postfix (RPN) alsorithm You can also use a stack to convert an infix expression to an RPN expression via the Shunting-yard algorithm The steps are shown below. Note that the algorithm is more complex that what was shown in class, because the project will include a power operator oeare agorithm is more complex that what was Process the expression from left-to-right When you encounter a value: Append the value to the RPN expression Push it onto the stack Until the top of stack is an opening parenthesis, pop operators off the stack and append them to o When you encounter an opening parenthesis: o .When you encounter a closing parenthesis: o the RPN expression o Pop the opening parenthesis from the stack (but don't put it into the RPN expression) .When you encounter an operator, oi While there is an operator, o2, at the top of the stack and either ois left-associative and its precedence is less than or equal to that of o2, or o1 is right-associative, and has precedence less than that of o Pop o2 from the stack and append it to the RPN expression o Finally, push oi onto the stack When you get to the end of the infix expression, pop (and append to the RPN expression) all remaining operatorS For example, given the expression 3 +4*2/(1-5) A 2A3