There are three stacks (A special kind of list) A, B and C. All the stacks support only the standard push (Add an element to the end of the list) and pop (Remove the last element from the list and return the value

) operations and checking whether the stack is empty or not. Stack A contains a sequence of n

(n >= 1) numbers in sorted order, where the largest number is at the bottom of the stack and

the smallest number is at the top of the stack. It is required to move n numbers in the stack A

to stack B. The numbers should appear in the stack B in the same order they appeared in stack

A.

The following pseudocode is intended to move all the numbers in the stack A to stack B

so that, after moving, the numbers will be in stack B in the same order they appeared in

stack A. It can use Stack C as well. What will be the appropriate values for X, Y and Z in

the given pseudocode?

MOVE (A, B, C):
   WHILE (stack A is not Empty):
      temp = A.pop()
      X.push(temp)
   ENDWHILE
   WHILE (Stack Y is not empty):
      temp = Y.pop()
      Z.push(temp)
   ENDWHILE