Write the pseudo-code of the function isSorted(Stack S)that takes as a 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(),top(), isFullStack(), and isEmptyStack(). You are allowed to use only one extra stack data structure. No additional arrays or lists.

(Python pls)

You answer should be similar the example provided.

while (!S.isEmpty())

S1.push(S.pop());

while (!S1.isEmpty())

S2.push(S1.pop());

while (!S2.isEmpty())

S.push(S2.pop());