(a) Write a method in Java to sort a stack of n integer numbers, s, in descending order.

static Stack sort(Stack s)

To implement this method you must use one more auxiliary stack and you should not make any assumptions about how the stack is implemented. The following are the only functions that should be used to write this program:

push, pop, peek, and isEmpty.

(b) What is the running time complexity of your method? Justify.