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