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:

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

2. Write a method that solves a multiplication problem recursively.

Instructions:

Use these sample run output values:

Recursive Fibonacci: 0, 3, 11

Recursive multiplication: 0 * 4 , 3 * 1 , 7 * 8 , 5 * 0 , 45 * 11