1 Consider our implementation of the Stack ADT using the Python list, and suppose we had used the front of the list as the top of the stack and the end of the list as the base. What impact, if any,...

1 Consider our implementation of the Stack ADT using the Python list, and suppose we had used the front of the list as the top of the stack and the end of the list as the base. What impact, if any, would this have on the run time of the various stack operations?

2 Show that all of the Stack ADT operations have a constant time in the worst case when implemented as a linked list.

3 Would it buy us anything to use a tail reference with the linked list structure used to implement the Stack ADT? Explain your answer.