The queue is referred to as FIFO because:

Question $26$Select one:

For any implementation, either enqueuing or dequeuing is O$($ n $)$

cross out

The container first grows then shrinks

cross out

We enqueue from the front

cross out

The last element we add in the container is the last one we remove