USING SUBSITUTION

2. Question 2 checks if we can solve recurrence equations. [4 Marks) Solve the following recurrence equation to get a closed-formula for T(n). You can assume the n is a power of two. T(n) = 1 if n=1 | = 2T () +log n if n 2 2 2. Question 2 checks if we can solve recurrence equations. [4 Marks) Solve the following recurrence equation to get a closed-formula for T(n). You can assume the n is a power of two. T(n) = 1 if n=1 | = 2T () +log n if n 2 2