need your help it's data structure questions ?

5- question funX(Queue Q) Stack S; While Queue is not empty Push(s, dequeue(Q)) End while While Stack is not Empty Enqueue(Q,pop(S)) End While End funx What is the objective of function funX ? a) Empties Queue Q b) Empties Queue Q and Refills it with same elements c) Empties Queue Q and Refills it with elements in reverse order d) Removes last element of Q a c) C quiz 6- question Assume that there is a circular queue implemented using an array with 10 elements. The front of queue is at index 7 and tail of queue (the last element in queue) is at index 9. Lets say we have inserted a new element. What is the index of inserted element? a) 10 b) 0 C) 6 d) 9 a a) b) c) d Leave blank