What does each remove_min call return within the following sequence of priority queue methods? add(5,A), add(4,B), add(7,F), add(1,D), remove_min( ), add(3,J), add(6,L), remove_min(), remove_min(), add(8,G), remove_min(), add(2,H), remove_min(), remove_min() Group of answer choices A. (7, F), (8, G) B. (1,D), (3,J), (4,B), (5,A), (2,H), (6,L) C. (1,D), (3,J), (4,B), (5,A), (2,H), (7, F) D. (6, L), (8, G)

Asap do this? .

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

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…