Question 13 Not yet answered Marked out of 1.00 Hide sidebars Flag question Given the following pseudo code of an operation that accepts a queue Q and uses Dequeue operation on 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) mk while (Q is not empty and m > 0) { Q.dequeue mm 1)) Select one A. 0(1) B. on) OC. O(n) D. 0(2)