[25 points] Question 2 (Queue ADT) a. [5 points) What are the advantages of circular queue implementation? b. [10 points) Given the Queue Interface and the LinkedQueue class, with operations; enqueue (), dequeue (), and isEmpty(), write the identical method that takes two queues; Queul and Queue2; and returns Boolean (true if the elements in Queuel are equal to elements in Queue2 in the same order, and false otherwise). c. [5 points] Given the Queue Interface and LinkedQueue class, trace the following code to find the implementation output. public class Question2 { static Queue Interface Test2 (Queue Interface q1) 1 int s = ql.size(); Queue Interface q2 = new LinkedQueue>(); for (int i = 0; i q = new LinkedQueue(); q.enqueue (2); q.enqueue (4); q.enqueue (6); q.enqueue (8); q = Test2(); while (!q. isEmpty()) System.out.print(q.getFront () + q.de queue(); } d. [5 points) What is the worst case time complexity to dequeue an element from a queue containing N elements implemented using a circular array? [25 points] Question 2 (Queue ADT) a. [5 points) What are the advantages of circular queue implementation? b. [10 points) Given the Queue Interface and the LinkedQueue class, with operations; enqueue (), dequeue (), and isEmpty(), write the identical method that takes two queues; Queul and Queue2; and returns Boolean (true if the elements in Queuel are equal to elements in Queue2 in the same order, and false otherwise). c. [5 points] Given the Queue Interface and LinkedQueue class, trace the following code to find the implementation output. public class Question2 { static Queue Interface Test2 (Queue Interface q1) 1 int s = ql.size(); Queue Interface q2 = new LinkedQueue>(); for (int i = 0; i q = new LinkedQueue(); q.enqueue (2); q.enqueue (4); q.enqueue (6); q.enqueue (8); q = Test2(); while (!q. isEmpty()) System.out.print(q.getFront () + q.de queue(); } d. [5 points) What is the worst case time complexity to dequeue an element from a queue containing N elements implemented using a circular array