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 $5$Select one:

O$(1)$

O$($n log$($n$))$

O$($n$2)$

O$($n$)$

O$($log$($n$))$