Fill in the code to complete the following function for computing a Fibonacci number. public static int fib(int index) if (index == 0

Question

Fill in the code to complete the following function for computing a Fibonacci number. public static int fib(int index)

Answer 1

return 0;

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;