Find a) overall run time T(n) and b) worst case run timeO(N) of this recursive function.

int mystery (int n)

{

if (n<= 1)

{return 1

}

else

{

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

}

}