Please read all guidelines! (JAVA)

rearrange Write a method rearrange that takes a Queue of integers as a parameter and that rearranges the order of the values so that all of the even values appear before the odd values and that otherwise preserves the original order of the list. Suppose a q stores the values: front [3, 5, 4, 17, 6, 8] back After calling rearrange , the q should store the values: front [4, 6, 8, 3, 5, 17] back Note that even numbers appear at the front of the queue followed by odd numbers, and that the relative order even/odd numbers is the same as in the original list. You may create one Queue as auxiliary storage, but you should not construct any other data structures