Problem
1. Evaluate the following postfix expressions. Show the stack as each operand and operator is processed.
• 23 * 4+
• 12 + 3 + 4 + 5+
• 12345 *+*+
2. The alternative implementation of the Queue ADT is to use a list such that the rear of the queue is at the end of the list. What would this mean for Big-O performance?