Suppose that the Stack class consisted only of the three methods push, pop, and isEmpty: public class Stack {
...
public Stack() { ... }
public void push(T item) { ... }
public T pop() throws NoSuchElementException { ... }
public boolean isEmpty() { ... }
}
Implement the following "client" method (i. e. not in the Stack class, but in the program that uses a stack):
public static int size(Stack S) {
// COMPLETE THIS METHOD
}
to return the number of items in a given stack S.
Derive the worst case big O running time of the algorithm you used in your implementation. What are the dominant algorithmic operations you are counting towards the running time?