https://www.coursehero.com/file/6218075/hw5sol/
Is one of the blurred questions in the above document the following:
Prove that the amortized cost of a sequence of n push operation on an initially emptymultistack is in O(n log n), where n is the maximum number of elements in the multistack.