In the array$-$based list implementation of the ADT sorted list, what is the worst$-$case time efficiency of the add$($newEntry$)$ method?

Group of answer choices

O$($log n$)$

O$($n$)$

O$($n$^2)-$ n raised to the power $2$

O$(1)$