Please, show all the work and comments for this java problem.
Implement a program in Java to sort a stack of integer in ascending order using for this purpose another auxiliary (temp) . 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.
peek - operation that returns the value of the top element of the stack without removing it.
What is the running time complexity of your program?