Suppose a queue contained the entries a, b, c, d (from head to tail) and suppose that the entries were removed and pushed on a stack one at a time until the queue was empty. what would be the contents of the queue (again from head to tail) if the entries were then popped from the stack and inserted back in the queue one at a time.

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: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is