Question 4 Not yet answered Given the following pseudo code of an operation that accepts a queue Q and uses Dequeue operation on Q, and the k is a global parameter. Suppose the queue Q is empty queue, then what is the worst case time complexity for the MultiDequeue() operation? MultiDequeue(Q) Marked out of 100 Flag question m - k while (Q is not empty and m > 0) { Q.dequeue() m = m - 1}} Select one: O A. 0(1) O B. O(n) O c. On9 OD. 0(21)