This is a 3 part question.

Determine what is calculated in this recursive function:

a.) double F (double x, int n)

if (n==0)

return 0;

else

return x + F (x, n-1);

}

b.) What is the outcome of the following:

if x = 5 and n = 4?

if x = 50 and n = 10?

c.) Rewrite the above function in non-recursive mode (using iteration).