Write a program that will produce the following output.

PROGRAMMING LANGUAGE: PYTHON

GUIDELINES:

****INFIX TO POSTFIX**** Enter the infix expression > A*B/2+C-D Postfix Expression is :: AB*2/C+D- CONVERTING INFIX TO POSTFIX EXPRESSION. The method of converting infix expression A+B* C to postfix form is: A+B*C Infix Form A+(B* C) Parenthesized expression A+(BC*) Convert the multiplication A (BC*) + Convert the addition ABC* + Postfix form The rules to be remembered during infix to postfix conversion are: 1. Parenthesize the expression starting from left to light. 2. During parenthesizing the expression, the operands associated with operator having higher precedence are first parenthesized. For example in the above expression B *C is parenthesized first before A+B. 3. The sub-expression (part of expression), which has been converted into postfix, is to be treated as single operand. 4. Once the expression is converted to postfix form, remove the parenthesis. Example: Give postfix form for A+[(B+C) + (D+E) *F]/G Solution: Evaluation order is A+{[(BC +) + (DE +) *F]/G} A+{[(BC +) + (DE +F *]/G} A+{[(BC + (DE +F*+]/G} . A+[BC +DE+F *+G/] ABC +DE+F* + G/+ Postfix Form Using Infix expression, convert the following into a postfix expression. INFIX (A + B) * C/D + E^ A/B (A + B) + C/D *E^A/B (A + B)/C/D *E^A/B (A + B) - C/D-E^A/B (A + B) + C/D *E^A/B POSTFIX AB+C *D/EAAB/+ AB + CD / EA^*B/+ AB + C/D/EA^*B/ AB + CD / - EA AB/- AB + CD / EA^* B/+