Need Python Code for the following task:

Infix, Postfix, and Prefix notations are three different but equivalent ways of writing expressions. In Infix notations, operators are written in-between their operands. However, in Prefix expressions, the operator comes before the operands. Assume the infix expression is a string of tokens delimited by spaces. The operator tokens are *, /, +, and -, along with the left and right parentheses, ( and ). The operand tokens are the single-character identifiers A, B, C, and so on.

The following steps will produce a string of tokens in prefix order: 1. Reverse the infix expression i.e A+ B * C will become C * B + A. Note while reversing each '(' will become ')' and each ')' becomes '('. 2. Obtain the postfix expression of the modified expression i.e C B *A +. 3. Reverse the postfix expression. Hence in our example prefix is + A* B C.

Write a function Infix_to_Prefix that takes an arithmetic expression in Infix notation as a parameter and returns the corresponding arithmetic expression with Prefix notation. Infix_toPrefix("( A + B) * (C + D )") >>> * + A B + C D Infix_toPrefix("A * B + C * D") >>> + * A B * C D