Analyze the amortized complexity of a sequence of n operations on two stacks that includes the following operations: the PUSH(k) operation pushes an object into stack(k), the MOVEALL operation moves all objects from stack 1 to stack 2 by iteratively popping the top object from stack 1 and pushing it into stack 2 one by one, and the POPALL operation pops all objects from stack 2.