Use a recursion tree to determine a good asymptotic upper bound on the recurrence

T(n)=T(n/2)+(1) Use the substitution method to verify your answer.