1.One stack is enough
2.Two stacks are needed
3.As many stacks as the height of the expression tree are needed
4.A Turing machine is needed in the general case
Answer:1