3. 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) ) a O O b) c) d) d 4. question Given the stack implementation code below (in C programming language) struct STACK { int stackArr[10] int top = } What will be the initial value of top? a) 1 b) -1 a a) b) 0 5- question If elements X Y" "Z" are placed in a Stack and popped one at a time what will be de order of deletion? a) XYZ b) ZXY a 6 0 0 b) b 200