Can someone explain these two types of C++ problems to me. I'm not understanding exactly how the answer is calculated.

Problem 1: What is the output of the following code fragment?

int f1(int base, int limit)

{

if(base > limit)

return -1;

else

if(base == limit)

return 1;

else

return base * fl(base + 2, limit);

}

int main()

{

cout <

return 0;

}

The output: 2. I see based on f1(2,4) that it chooses return base * f1(base+2,limit); . How does it compute this to get 2?

Problem 2: The recursive definition of a Fibonacci Number is F(n)=F(n-1)+F(n-2), where F(0)=1 and F(1)=1. What is the value of Fib(5)?

Answer: 8. How does it calculate this answer? I see it looking like this: F(5-1) + F(5-2)

Thanks for the help.