Please answer all the questions thank you

6. 18 Points) Queue: a. Consider the following operation along with enqueue () and dequeue () operations on queues, where k is a global parameter. MultiDequeue (Q): while (is nnot empty and m > 0): dequeue (Q) mm - 1 // end while 1/ end method What is the worst case time complexity of a sequence of n MultiDequeue () operations on an initially empty queue? Circle one of the options below: O(n). O(n+k) O(nk) O(n). b. Given a queue, write a method (pseudocode) to reverse the queue using another empty queue. You may only use queue operations such as enqueue, dequeue, and size. No other data structure can be used other than a queue. Consider the following examples: Input: Queue = {1, 2, 3, 4, 5) Output: (5, 4, 3, 2, 1) Input: Queue = {10, 20, 30, 40, 50) Output: 150, 40, 30, 20, 10}