Consider the following pseudo code implementation of Enqueue and Dequeue operations using two initially empty very large stacks P and Q, with primitive stack operations PUSH and POP.

Stack P, Q;

Enqueue(key k)

       PUSH(k,P);

Dequeue( )

{

      if(Q is empty)

       {

         while(P is not empty)

             MISSING STATEMENT ;

        }

       return POP(Q);

}

Choose the correct statement in place of MISSING STATEMENT.(Ignore error handling).