need solution for this with explaination

Amortized Analysis Consider an ArrayStack implementation of the List interface with a slightly altered resize () operation. Instead of reserving space for 2n elements in the new array, it reserves space for n+4n elements. Prove that the append() operation still takes O(1) time in the amortized sense