The queue contains elements 200, 253, 227, 240, 270 from rear to front initially. After the following algorithm is performed, what is the status of queue from rear to front?
algo: myAlgo (queue Q)
{
size = queue count (Q)
counter = 0;
while (counter < size)
{
dequeue (Q, queuedata)
if (queuedata < 2 45)
{
enqueue (Q, queuedata);
dequeue (Q, queuedata);
counter = counter + 1;
}
else
enqueue (Q, queuedata)
counter = counter +1;
} return;
}
1
200, 240, 227
2
240, 200
3
200, 240
4
253