$($a$)$ Write an algorithm to sort a stack of integers so that the smallest

are at the top. You can only use one $(1)$ additional temporary stack and a constant number of temporary integer variables.

a constant number of temporary integer variables. You cannot copy elements into another

data structure $($such as an array$).$ The stack supports the following operations: push,

pop, peek and isEmpty. Give pseudo$-$code or Java$-$type code. $($b$)$ Give the worst$-$case execution time in

in grand$-$O notation. You don't need to prove it$,$ but show your understanding by

understanding by mentioning what type of instances would give the worst case.