Problem
1. Turn your direct infix evaluator from the previous problem into a calculator.
2. Implement the Queue ADT, using a list such that the rear of the queue is at the end of the list.
3. Design and implement an experiment to do benchmark comparisons of the two queue implementations. What can you learn from such an experiment?