A queue with two stacks: s1 and s2. Enqueue: push an element on to s1. Dequeue: pop an element from s2. If s2 is empty, each element in s1 will be popped off and pushed on to s2. Then pop the top item from s2. Show that the amortized cost of this implementation is O(1).