Given standard stack operation. push(S, x), pushes the value x in stack S and…

Given standard stack operation. push(S, x), pushes the value x in stack S and function pop(S) pop the top value from stack S. For any queue Q, let enqueue(Q,x) pushes value x in rear side of queue and dequeue(Q) removes front element from queue. For the given function, what does the following function performs ( Q and S are predefined queue and stack respectively)?
Void fun(int n){
          int x;
          while(n != 0){
                    x =  n%2;
                    enqueue(Q,x);
                    n = n/2;
          }
          while(!isEmpty(Q))
                    push(S, dequeue(Q));
          while(!isEmpty(S))
                    print(“%d”, pop(S));
          print(“\n”);
}