Consider the following array: int$[]$ numbers $=\{2,5,8,12,16,23,38,56,72,91\}.$

Perform a BINARY search to find the index of the element $23.$

What is the time complexity of the binary search algorithm?

a$.O(logn)$

b$.O(n)$

c$.O(n^2)$

d$.O(1)$

Clear my choice