In this problem you are simulating a HOT DOG stand. You will need to fill a queue with the provided ArrayList of integers. You will need to return the third rotation of the queue line.

public ArrayList solution(ArrayList list) {

// your code goes here

return null;

}

Case example1: given: []

solution: []

Case example2: given: [8, 7, -8, -4, -8, -4, -5]

solution: [-4, -8, -4, -5, 8, 7, -8]