Your question is Binary Search Implementation and Complexity. 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).
How would you implement binary search on a sorted array, and what are its time and space complexity characteristics?