3. Recall that we have discussed the method of explicit substitution to solve a recurrence relation It expands out the recurrence a few times until a pattern emerges. For instance, let us start with the recurrence T(n) 2T(n/2) cn where c is a positive constant. By repeatedly applying this rule, we can bound T(n) in terms of T(n/2), then T(n/22), then T(n/2), and so on, at each step getting closer to the basis value of 27(n/2)
OR
OR