Use the master method to show that the solution to the binary-search recurrence T(n)=T(n/2)+Θ(1)T(n)=T(n/2)+Θ(1) is T(n)=Θ(lg⁡n)T(n)=Θ(lgn). In your response, capitalize a few words to stress main points. Please limit the number of words with all capital letters to less than 19.
user