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

Group of answer choices

O$(1)$

O$($n$)$

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

O$($log n$)$