Stacks are used for converting infix expressions to postfix expressions. What is the postfix form of the infix expression "A + B * C"?Group of answer choicesA B + C *A + B C *A B C * +B C * A +

The postfix form of the infix expression "A + B * C" is "A B C * +".

Here's the step-by-step process:

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. Pop and discard the '('.
6. Repeat steps 2-6 until infix expression is scanned.
7. Print the output
8. Pop and output from the stack until it is not empty.