We assign the following amortized costs: Push 4, Pop 0, Multipop 0, Stackcopy 0.
As in the textbook, we use a dollar bill to represent each unit of cost. Every time we do a Push operation, we pay a dollar to perform the actual operation and put one dollar into credit. That leaves us with two dollars, which is placed on that element. When we Pop that element, one of the two dollars is used to pay for the Pop operation and the other dollar is again saved into credit. Credit is used to pay for the Stackcopy operation. Since after every k operations, there are at least k dollars in credit, and the stack size is never more than k, there is enough money in credit to pay for the Stackcopy operations. The cost of n stack operations, including copying the stack, is thus O(n).