solve in java

Write a method called rearrangeQueue to be in a class called Queue App and has two parameters 91 and 22 type ArrayQueue. The q1 data is of type Integer and q2 data is of type Character. The method will remove from q1 those elements for which the corresponding elements of q2 are not 'A', 'D' and 'N', and adds the elements removed at the end of q1. It returns the number of elements moved to the end of the queue. Assume q1 and 2 have the same number of elements. Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays. Example: Before method call: rear front 91: 4 556 2 9 54 90 12 89 92: AEGNS B N D B After method call: front rear 91: 55 6 9 54 89 4 2 90 12 It returns 4. Method heading: public class QueueApp { public static int rearrangeQueue(ArrayQueue 91, ArrayQueue92) {