Solve CLRS $2\mathrm{.}3-5$ recursively. The problem asks you to give pseudocode for binary

search. Let T$($n$)$ be the total runtime. Give the recurrence for T$($n$)$ and solve it using the

recursion tree method.