The postfix form of the expression (A+ B)*(C*D- E)*F / G is?1 pointAB+ CD*E – FG /**AB + CD* E – F **G /AB + CD* E – *F *G /AB + CDE * – * F *G /

The postfix form of the given infix expression (A + B) * (C * D - E) * F / G is:

AB+ CD*E- FG/

Here's how you can convert the infix expression to postfix:

1. Scan the infix expression from left to right.
2. If the scanned character is an operand, output it.
3. Else,
   • If the precedence of the scanned operator is greater than the precedence of the operator in the stack(or the stack is empty), push it.
   • Else, Pop the operator from the stack until the precedence of the scanned operator is less-equal to the precedence of the operator residing on the top of the stack. Push the scanned operator to the stack.
4. If the scanned character is an '(', push it to the stack.
5. If the scanned character is an ')', pop and output from the stack until an '(' is encountered.
6. Repeat steps 2-6 until infix expression is scanned.
7. Pop and output from the stack until it is not empty.

The postfix form of the expression (A+ B)(CD- E)*F / G is:

Step 1: Convert the infix expression to postfix expression.

The infix expression is: (A+ B)(CD- E)*F / G

Step 2: Apply the postfix conversion rules.

According to the postfix conversion rules, the operators are written after their operands. The order of operations in postfix conversion is parentheses, exponentiation, multiplication and division (from left to right), addition and subtraction (from left to right).

Step 3: Convert the infix expression to postfix expression.

The postfix expression is: AB+ CD*E- FG/

So, the postfix form of the expression (A+ B)(CD- E)F / G is AB+ CDE- FG/.