data structures using the algorithm given below transforms an infix expression into postfix expressionas shown in fig the algorithm accepts an infix expression that may contain operatorsoperandsand parentheses for simplicitywe assume that the infix operation contains only modulus (%)multiplication (*)division (/)addition (+)and subtraction (--operators and that operators with same precedence are performed from left-to-right the algorithm uses stack to temporarily hold operators the postfix expression is obtained from left-to-right using the operands from the infix expression and the operators which are removed from the stack the first step in this algorithm is to push left parenthesis on the stack and to add corresponding right parenthesis at the end of the infix expression the algorithm is repeated until the stack is empty step add ")to the end of the infix expression step push "(on to the stack step repeat until each character in the infix notation is scanned if "(is encounteredpush it on the stack if an operand (whether digit or characteris encounteredadd it to the postfix expression if ")is encounteredthen repeatedly pop from stack and add it to the postfix expression until "(is encountered discard the "(that isremove the "(from stack and do not add it to the postfix expression if an operator is encounteredthen repeatedly pop from stack and add each operator (popped from the stackto the postfix expression which has the same precedence or higher precedence than push the operator to the stack [end of ifstep repeatedly pop from the stack and add it to the postfix expression until the stack is empty step exit figure algorithm to convert an infix notation to postfix notation solution infix character scanned stack postfix expression abc/def*% /+ *example convert the following infix expression into postfix expression using the algorithm given in fig (aa ( ( fg) (ba ( ( fg)hprogramming example write program to convert an infix expression into its equivalent postfix notation #include #include #include #include #define max char st[max]int top=- void push(char st[]char)char pop(char st[])