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)}.
A. fib(index - 1).
B. fib(index - 2).
C. fib(index - 1) + fib(index - 2)
D. fib(index - 2) + fib(index - 1).

Answer 1

Answer:

B

Explanation:

its easy just type that in