Convert the following infix expressions to postfix form by using the pseudocode given in section $6\mathrm{.}3($the above link$).$ Create a table that shows the values of i$,$ ch$,$ the stack, and the expression after each step of the algorithm.

d$.$ a$-$b$+$c

e$.$ a$/($b$*$c$)$

f$.($a$+$b$)*$c

g$.$ a$-($b$+$c$)$