Suppose that Queue is a properly built First in First Out (FIFO) data structure. Analyse the next bit of code:

1. Queue numbers = new Queue();

2. numbers.push(1);

3. numbers.push(2);

4. numbers.push(3);

5. numbers.push(4);

6. numbers.push(5);

7. while (! numbers.isEmpty()) {

8. System.out.print(numbers.pop());

9. }

What is the output of this program at the end of line 9? Hint: Note that the program does NOT write any white spaces.