a 1) Consider we are computing power of n (i.e., b) using recursive design approach. Here n is the exponent and b is the base for which we need to compute the power recursively. Show your complete work and justify for the following problems. a. Provide the recurrence expression T(n) for this recursive power function. [4pts] b. Provide the base case and value of k. [2pts] C. Provide the time-complexity of the recurrence without solving it. [using master theorem] [2ps] ((n)=(n-1) + (1(n-1) +(~~-x) 109, a / A recursive power function to find out the value of b power n. / int power (int b, int n) ( int m if (n == 0) return 1 if (n 2 == 0) ( m power (b, n / 2); return b. bi else return b power (b. n 1);