Do in java

import java.util.Deque; import java.util.ArrayDeque;

class Tester { public static Deque

public static void main(String[] args) { Deque integerQueue = new ArrayDeque(); integerQueue.add(3); integerQueue.add(6); integerQueue.add(9); Deque characterQueue = new ArrayDeque(); characterQueue.add('a'); characterQueue.add('e'); characterQueue.add('i'); characterQueue.add('o'); characterQueue.add('u'); characterQueue.add('b'); Deque

Problem Statement Merge a given queue of integers and a queue of alphabets to form a single queue based on the below mentioned rules: Merge elements at the same position starting with the integer queue. . If one of the queues has more elements than the other, add all the additional elements at the end of the output queue Implement the logic inside mergeQueue() method. Test the functionalities using the main() method of the Tester class. Sample Input and Output