Fibonacci

Background:

The Fibonacci number series is defined as follows:

Positions 0 & 1 are definition values. For positions greater than 1, the corresponding Fibonacci value of position
N = Fib (N-1) + Fib (N-2).

Assignment:

Write a recursive method (called "fibonacci") that takes in a single integer (x >= 0) and returns the appropriate Fibonacci number (an integer) of the Fibonacci number series.

Instructions:

Use these sample run output values:

Recursive Fibonacci: 0, 3, 11