Dynamic Array Growth Strategy & Amortized Cost

Understand why a multiplicative growth factor yields O(1) amortized append while a fixed increment does not.

A dynamic array supports append by copying all elements into a new buffer when full. Suppose instead of doubling, the array grows by a FIXED increment of k elements each time it fills. Starting empty and performing n appends, what is the correct amortized cost per append?