Help me mainly on part b, please. Thank you

Give an asymptotic upper bound for the recurrence above. Assume T(n) is constant for small n, in other words T(1) = (1). Make your bounds reasonably tight, and justify your answer using one of the methods given in class, but not the Master method. a. b. Explain why this recurrence equation above could be gotten from a standard recursive implementation of the binary search algorithm. Try to use the divide, conquer and combine paradigm in your explanation