Answer Happy

2. Solve recurrence relation using any one method: Find the time complexity of the recurrence relations given below using any one of the three methods discussed in the module. Assume base case T(0)=1 or/and T(1) = 1. a) T(n) = 4T (n/2) + n b) T(n) = 2T ( n/4) + n²