3.Which of the following about the binary search algorithm is TRUE?
(A) It is not possible for a binary search to find the value 2 in the array of [1, 3, 7, 9, 4, 2, 11]
(B) The maximum number of comparisons required to perform a binary search of a 1000 elementarray is 9
(C) The best-case time complexity of a binary search is O(log N), with N the number of elementsin an array
(D) An iterative implementation of the binary search has a space complexity of O(N), with N thenumber of elements in an array