def has_at_least(queue: Queue, n: int) -> bool: """Return true iff queue contains at least n items. Precondition: n >= 0 >>> queue = Queue() >>> queue.enqueue(1) >>> queue.enqueue(2) >>> queue.enqueue(3) >>> has_at_least(queue, 3) True

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.