For a dynamic array of length $N,$ the worst$-$case and amortized$-$case complexities of inserting a number at the end are

$O(N)$ and $O(N^{**}(N))$ respectively

$O(N)$ and $O(1)$ respectively

$O(N)$ and $O(logN)$ respectively

$O(N)$ and $O(N)$ respectively

ear my selection