Binary search has O(ln n) time complexity. This means that for each division of the data structure, there are exactly two places that the element sought can be found; in both the upper and lower divisions created by the algorithm.

a. This statement is partially true; binary search always has to remember the portion of the data structure not in focus

b. never

c. While this statement is true, there are other factors to consider which posit sufficiency