In the unsorted array$-$based dictionary, the worst$-$case time efficiency of adding a key$-$value pair is

Group of answer choices

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

O$($log n$)$

O$($n$)$

O$(1)$