O False Question 26 ot 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){ arked out of 1.00 Flag question m = k while (Q is not empty and m > 0) { Q.dequeue m = m - 1 >> Select one: O AO(1) OB. O(n) O CO(n) OD. 0(2) PREVIOUS PAGE NEXT PAGE