Given a queue of integers, reorder the queue so that all of the even integers come before all of the odd integers. The even numbers should remain in their original order, and the odd numbers should remain in their original order. Use one auxiliary queue to solve this problem. (Hint: Put all odds into the auxiliary queue and move them back in).

 Start your code with:
  Queue<Integer> queue1 = new LinkedList<Integer>(list);
  Queue<Integer> queue2 = new LinkedList<Integer>();