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) 00 m = =k while (Q is not empty and m > 0) { Q.dequeue m = m - 1}} Select one: O A. O(1) OB. O(n) - C. O(n) D. 0(2)