Question

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.MultiDequeue(Q){ m = k while (Q is not empty and m > 0) { Dequeue(Q) m = m - 1 } }What is the worst case time complexity of a sequence of n MultiDequeue() operations on an initially empty queue? (GATE CS 2013) (A)  (B)  (C)  (D) 

A. A

B. B

c. C

D. D


​

Answer 1

Answer:

i thought it B is the correct answer

Explanation:

Mark me a brainliest