Given a circular array-based queue (maxSize = 50) with queueFront = 11, and queueRear = 12. At which array index will a new item be inserted? • 14 • 12 11 13

15. If a queue is implemented under an ArrayList, how much time does a queue add an item? a. 0(1) b. O(n) с. О(n2) d. 0(log n)

Suppose the rule of the party is that the participants who arrive later will leave earlier. Which data structure is appropriate to store the participants? Stack Queue ArrayList Linked List

Java: Which of the following operations has the least running time in a Queue (assume that only Queue interface operations are available; some operations may require use of an additional temporary  queue)? Multiple choice. Deleting the element at the rear of the queue Checking if an element x is present in the queue Finding the number of elements in the queue all of the above have identical worst case running time

DONT use any of the list methods (append, pop etc.). class mycircularqueue():        def __init__(self, m = 10):        self.maxsize = m        self.array = [None]*m        self.FRONT = self.REAR = -1                def enqueue(self, item):         # Inserts item at the rear of a non full queue and returns True. If unable to insert the item returns false                #######################################################################        # Remove the pass statement and write your code        #######################################################################        pass     def dequeue(self):        # Removes the item from the front of the queue and returns it. For unsuccessful dequeue return False                #######################################################################        # Remove the pass statement and write your code        #######################################################################        pass        def peek(self):        # Returns the…

java Suppose queue is defined as LinkedQueue<Integer> queue = new LinkedQueue<>(); Show what is written by the following segment of code. SHOW YOUR WORK.