Using a sequential stack, design an algorithm to convert an infix expression to a postfix notation
and output it. For example, input the infix expression: a+b/c(de+f)g Output its postfix
expression: abc/+df+g.
Using a sequential stack, design an algorithm to convert an infix exp.pdf
1. Using a sequential stack, design an algorithm to convert an infix expression to a postfix notation
and output it. For example, input the infix expression: a+b/c(de+f)g Output its postfix
expression: abc/+df+g