Suppose you were given a stack and

you were allowed to use one additional

stack, without copying the elements

into any other data structure. Write a

program to sort the stack in ascending

order $($biggest items on the top$).$ The

stack supports push, pop, peek, and

isEmpty operations.