consider the following function;

int rfunc (int n)

{

if(n==0)

return 0;

else

return rfunc(n / 3 + 1) + n - 1;

}

what will happen if the function is called?

A) the resursive call ensures that the problem instance is similar with each invocation.

B) the function repeadtly calls itself upon reaching a certain value for n

C) Nothing out of ordinary. The base case is well defined and ensures that recursion terminates.

D) The recursion only terminates if the function is called with a value greater than 5