Convert the following infix expressions to postfix form by using the algorithm given in this chapter. Show the status of the stack after each step of the algorithm. a. a-b+c b. a-(b/c*d) c. a/(b*c) d. a/b/c-(d + e) *f e. (a+b) *c f. a*(b/c/d) +e g. a-(b+c) h. a-(b+c* d)/e for each character ch in the infix expression) switch (ch) A pseudocode algorithm that converts an infix expression to postfix form case operand: Append operand to end of postfix expression-step 1 postfixExp = postfixExp.ch break case '(': // Save'' on stack-step 2 aStack.push(ch) break case operator: // Process stack operators of greater precedence-step 3 while (!aStack.is Empty and aStack. peek is not a 'C' and precedence (ch)