Worst$-$case complexity of binary search is

Group of answer choices

O$($n log n$)$

O$($n$)$

O$($log n$)$