Assuming the standard stack functions are available to you write Java code that will determine which value in the stack is the smallest and move that value to the top of the stack while otherwise leaving the remainder of the stack in its original order.
Thus if the stack contains the double values: (bottom 4 2 8 3 6 5 top) then a call to moveSmallestToTop(stack) would leave stack as follows: (bottom 4 8 3 6 5 2 top).
It is only an example. You can have any number of elements in the stack.
You cannot declare new arrays, lists, etc., but can use another stack if necessary.
The method skeleton is given below.
// Finds the smallest value in myStack and moves it to the top of the stack,
// otherwise leaves myStack in the original order.
// Does nothing if myStack is empty.
public static void moveSmallestToTop (Stack myStack) {
//YOUR CODE GOES HERE
}