Answer the following questions.

1) Answer with a whole number: While processing this expression ( ( ) ( ) ( ( ) ( ) ) ) what is the highest number of elements on our stack at any one time? __________

2)Explain the difference between the classic definition of the pop operation on a stack and the modern definition we use in the text.

3) While evaluating the following postfix expression: 6 4 + 3 10 * + 2 2 - + how many times is the push operation called?

4)

What is the order of growth execution time of the push operation when using the ArrayBoundedStack class, assuming a stack size of N? A) O(1) B) O(N) C) O(N^2) D) O(LOG2N)