What is the amortised time complexity of push and pop operations in a dynamic array?

Question

Accepted Answer

(D) O(1). Explanation: Dynamic arrays occasionally resize (O(n)), but averaged over all operations, cost per operation is O(1) amortised.