1. Show that all of the Stack ADT operations have a constant time in the worst case when implemented as a linked list.
2. Would it buy us anything to use a tail reference with the linked list structure used to implement the Stack ADT? Explain your answer.
3. Evaluate the run time of the isValidSource() function where n is the number of characters in the C++ source file.