public static int f(int n) {

if ( n < 0 )

return 2;

else

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

}

What value is returned by the call f(2)? Please explain the recursive solution step-by-step.

Thanks!