What is the Big$-$O complexity of adding a new element to the end of an array$-$based list? You may assume the list has sufficient capacity for that one element.

Question $4$Select one:

O$($ N log N $)$

O$($ log N $)$

None of the listed choices is correct

O$($ N$2$ log N$)$

Compilation errors

O$($ N $)$

O$($ N$2)$

O$($ N$3)$

O$(1)$