The following routine makes use of two queues: Q₁, Q₂, and one stack: 5. Initially the queue Q₁ containers 2, 4, 6, 8, 0, 5, 9, 0, 7, 4, 1, 0, 1 from front to rear. What are the contents of queue Q₂ from front to rear after the execution of the following function?

void myFunc1(  )

{

int i ;

while (!empty queue (Q₁)) {

int x=dequeue (Q₁, i)

if (ẋ = = 0)

{

while (!empty stack (5))

Enqueue (Q₂, popstack (5));

}

else

pushstack (5, i);

}

}