We want to reverse elements of stack using a queue.Suppose stack operations,push and pop take 1 unit of time each and queue operations insert and delete take 2 units of time each.Assume n elements are there in the stack.The minimum time to reverse the stack is
(A) 4n units
(B) 6n units
(C) 8n units
(D) 9n units