Whenever you're ready, walk me through how you'd approach this.
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.
