Write the pseudo code of the function isSorted (Stack S) that takes as parameter a stack S, and checks if the stack is sorted (either in increasing or decreasing order) or not. When the function is done, the stack should be in its original state. The only operations that you can do on the stack are the following: push(), pop 0, top (), isFullStack(), and isEmptyStack(). You are allowed to use only one extra stack data structure. No additional arrays or lists. You answer should be similar the example that was presented in the lecture and here it is again. Question: Write the pseudo-code for an algorithm to reverse the order of elements on a stack with n elements. The algorithm should use two additional stacks. Answer: while (!S.isEmpty()) S1. push (S.pop(); while (!S1.isEmpty()) S2. push (S1.pop()); Reverse everything from S into S1 Reverse everything from S1 into S2 while (!S2.isEmpty ()) S. push(S2.pop()); Reverse everything from S2 into S