Your question is Time Complexity of Binary Search. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Explain the time complexity of binary search, including why it is O(log n), what assumptions it depends on, and how the analysis changes if the input must be sorted first.