Question

Fill in the code to complete the following function for computing a Fibonacci number. public static int fib(int index) { if (index == 0 || index == 1) // Base case ________ else // Reduction and recursive calls return fib(index - 1) + fib(index - 2); }

Answer 1

Answer:

return 0;

Step-by-step explanation:

The  Fibonacci numbers such that each number is the sum of the two preceding ones, but the first therm of the sequence cannot be built by this rule.

In that $F_{0} = 0$

Then you may define it in the base case

return 0;