• Perform a full analysis of both the power() and factorial() function .That is for each function, find T(n) which represents the worst case complexity for these two functions. State their upper bounds. Please see https://catherine-leung.gitbook.io/data-strutures-and-algorithms/recursion/analysis-of-a-recursive-function on how to do a recursive analysis.

unsigned int factorial (unsigned int n){

if (n == 0)

return 1;

return n * factorial(n - 1);

}

double power (double base, unsigned int n){

if (n == 0)

return 1;

if (n & 1)

return base * power(base, n / 2) * power(base, n / 2);

return power(base, n / 2) * power(base, n / 2);

}