Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.
GATECSE <code class="language-c">
MultiDequeue(Q){
m = k
while (Q is not empty) and (m > 0) {
Dequeue(Q)
m = m – 1
}
}
</code>
What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue?
(A) $Θ(n)$
(B) $Θ(n + k)$
(C) $Θ(nk)$
(D) $Θ(n^2)$
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.
<code class="language-c">
MultiDequeue(Q){
m = k
while (Q is not empty) and (m > 0) {
Dequeue(Q)
m = m – 1
}
}
</code>
What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue?
(A) $Θ(n)$
(B) $Θ(n + k)$
(C) $Θ(nk)$
(D) $Θ(n^2)$