Solve recurrence relation using three methods: a. Write recurrence relation of below pseudocode that calculates x", and solve the recurrence relation using three methods that we have seen in the explorations. power2(x,n): if na: return 1 if n=-1: return x if (n%2)==0: return power2(x, n//2) * power2(x,n//2) else: return power2(x, n//2) * power2(x,n//2) + x b. Give the asymptotic bounds for T(n) in each of the following recurrences. Make your bounds as tight as possible and justify your answers. Assume the base cases T(0)=1 and/or T(1) = 1. a)T(n) = 4T (n/2)+n b) T(n) = 27 (n/4) + n2