Question: $1$

I need step by step answer for my better understanding

Which of the following is true about the time complexity of binary search?

A$.$ O$($log n$)$

B$.$ O$($n$)$

C$.$ O$($n log n$)$

D$.$ O$($n$^2)$

If You Write AI Answer $-$ I will give $15$ Dislikes For Sure.