bonus$)$ The time complexity of binary search is$\_\_\_\_\_*$O$($n$2)$O$()$O$($log n$)$O$($n$)$