IN JAVA: Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators.

Method head:

public void changeQueue(E item)

Example1:

Before run: front rear

this queue: 10 29 2 2 5 10

Item1: 100

After run:

front rear

this queue: 100 29 100 100 5 100

Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non- empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void change Queue(E item) Example1: Before run: front rear "this" queue: 10 29 2 2 5 10 Item1: 100 After run: front "this" queue: 100 29 100 rear 100 5 100