In implementing dynamic arrays, if we expand the array by a fix number of cells when the array is full, then the asymptotically tight amortized $($average$)$ time for inserting elements into the dynamic arrays will be per item.

$O(1)$

$O(logn)$

$O(n^2)$

$O(n)$