If front=2 and rear=5, how many elements are there in an array-based queue (note: rear is pointing at the next free location) O 3 O 5

How to answer the following questions screen shot show the text's arrayboundedqueue and the array unbounded queue The text's array-based queue is being used and holds a queue with a single element. We can say: A. the element is held at index 0. B. the value of front is -1 C. the value of front is one less than the value of rear. D. the value of front is equal to the value of rear.

14. If a queue is implemented under an ArrayList, how much time does a queue remove an item ? а. О(1) b. O(n) c. 0(n2) d. 0(log n)

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)

Java, Insertion Sort Table. Thank you

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…