READ THE FOLLOWING CODE CAREFULLY AND INDICATE THE OUTPUT.

ASSUME THAT S IS A STACK AND Q IS A QUEUE. ALSO ASSUME

ALL STACK AND QUEUE OPERATIONS ARE DEFINED.

Assume Maxstack = 4 and Maxqueue = 5

CLEARSTACK(S);

CLEARQUEUE(Q);

A = 13;

B = 6;

PUSH(S,0);

INSERT(Q,3);

A = A+2;

WHILE (A > (B+1)) & (! Fullstack(S))

IF (A < B*2) and (!Fullqueue(Q))

INSERT(Q,B)

ELSE IF (!Fullstack(S))

PUSH(S,B);

ENDIF;

B = B+1;

A = A 1:

ENDWHILE;

Write (A,B);

WRITE("QUEUE CONTAINS");

WHILE (!EMPTYQUEUE(Q)) DO

DELETE(Q,A);

WRITE(A);

If (!FullStack(S))

Push(S,A)

Endif

ENDWHILE;

WRITE("STACK CONTAINS");

WHILE (!EMPTYSTACK(S)) DO

POP(S,B);

WRITE(B);

ENDWHILE;

WRITE(A,B);