Implement queue by using stack

Question

Define how to implement queue by using stack?

Answer 1

A queue can be implemented with two stacks as follows:

a. An element is inserted within the queue through pushing this within stack 1

b. An element is extracted by the queue through popping this from the stack 2

c. When the stack 2 is empty then each element currently within stack 1 are transferred to stack 2 but within the reverse order

d. When the stack 2 is not empty only pop the value by stack 2.