provide the best upper (O()) and lower (Omega()) bounds

int fib(int n)

{

if( n==0 )

return 0;

else if( n==1 )

return 1;

else

{

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

}

}

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;

}

}

}