data structures in java

data structures in java

Write a method called changeQueue to be considered inside the ArrayQueue cless and has one parameter item of type E. Your method will change the queue in such a way that it the the first element of the quese and the last element of the queue are equal, the first and last elements in the queue will be replaced with itern, 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 dass. Do not use iterators. Method head public void changeQueue item Example1: Before run front rear this" queue: 10 29 2 2 5 10 itemi: 100 After run: front rear "this queue: 100 29 100 100 100 Write a method called change Queue to be considered inside the Arrayudes and has one porte moet method will change the queue in such a way that if the the first element of the and the last of the the first and last elements in the queue will be replaced within otherwise do not do any de Salary the same process done for the second element in the queue and the element before the last in the queue and so on. Assume you have queue with even number of elements. You are not allowed to call any method from the the Arrayos din motor Method head: public void changeQueue item) Example 1: Before run front rear this" queue: 10 29 2 2510 Item 1: 100 After run: front rear this queue: 100 29 100 100 5 100