Which of the followings is true for Binary Search algorithm?

a$.$

It's time complexity is O$($n logn$)$ since it processes each recursive call in logarithmic time.

b$.$

It's time complexity is O$($logn$)$ since it processes each recursive call in constant time.

c$.$

It's time complexity is O$($logn$)$ since it processes each recursive call in logarithmic time.

d$.$

It's time complexity is O$($n logn$)$ since it processes each recursive call in constant time.