data structures and algorithms in java

Question 5 (4 marks) Consider the following class ArrayQueue: class ArrayQueue public static final int CAPACITY = 1000; private inttl data; private int front 0; private int gSize 0; public ArrayQueue) h public ArrayQueue (int capacity) ) public int size) public boolean isBmpty) (h public void enqueue (int e) public int firsto t public int dequeue() public string toString t Write a method splitQueue () that takes as parameters three queues OriginalQ, oddo and EvenQ. It should split the Originalo into two queues: Oddo that contains only odd numbers of Originalo, Eveno that contains only even numbers of Originalo, Keeping OriginalQ unchanged