Consider the usual algorithm to convert an infix expression to a postfix expression. Suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols:

+

(

*

BOTTOM

Now, suppose that you read and process the 11th symbol of the input. Picturize the stack for the case where the 11th symbol is:

a. A number:

b. A left parenthesis:

c. A right parenthesis:

d. A minus sign:

e. A division sign: