How recursive algorithm uses stack to store intermediate results? Illustrate with an example. Convert the infix expression  A+B-(C*D/E+F)-G*H into postfix expression using stack.