In a queue, the element removed first is the one that has been in it:

1. A queue never reorders what is waiting inside it. 2. The oldest arrival reaches the front first. 3. The element that has been longest in the queue will be removed first. 4. So the answer is longest. _Source: syllabus Computer Science, Ch 3 'Stack' and Ch 4 'Queue'_