Hello, I would like to get help with the following algorithms and their respective analysis of runtime along with their recurrence equations, thanks in advance.

1. Analyze each of the following algorithms by providing a tight big-Oh bound on the run time with respect to the value n. Create a recurrence equation.

g.

void hanoi(int n)

{

if( n==1 )

time++;

else

{

hanoi(n-1);

time++;

hanoi(n-1);

}

}

h. For this problem, provide the best upper (O()) and lower (Omega()) bounds you can. They might not quite match, but get them as close as you can.

int fib(int n)

{

if( n==0 )

return 0;

else if( n==1 )

return 1;

else

{

return fib(n-1) + fib(n-2);

}

}

i.

int pow(double x, int n)

{

if( n==0 )

return 1;

else

{

double halfpower = pow(x,n/2);

if( n % 2 == 0 )

{

return halfpower*halfpower;

}

else

{

return halfpower*halfpower*x;

}

}

}