CodingRecurrencesEasySolving T(n) = T(n/2) + 1Solve T(n)=T(n/2)+1.Quant interview-style problem · QS-XNA010Report an issueYour answerSubmit AnswerShow HintShow SolutionWatch Video