Recursive Fibonacci Method

Complete the static method fib so it returns the nth Fibonacci number using RECURSION, where fib(0) = 0, fib(1) = 1, and each later value is the sum of the previous two.

For fib(10) the program prints 55.

Expected Output:

55↵
0↵
1↵

= newline. The output ends with a newline — print one after the last line.

Hints4 available

Topics:

Methods

Code Editor

Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (sysout, psvm, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.