5. Divide-and-Conquer Having seen the power of recursion and divide-and-conquer, the TA decided to write a program to compute (a) His first attempt was function Power(x, n) 1: if n = 0 then 2: return 1 3: else if n is odd then 4: return x * Power(x, [n/2) * Power(x, [n/2]) 5: else 6: return Power(x, [n/2]) * Power(x, [n/2]) 7: end if Analyze the time required by this algorithm (b) His second attempt was function Power(x, n) 1: if n 0 then 2: return 1 3: else 4: integer t Power(2, Ln/2]) 5: if n is odd then return x * t * t 7: else return t* t 9: end if 10: end if Analyze the time required by this algorithm