Fibonacci Sequence(Numbers) are numbers that form a sequence that looks like this

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...

Fibonacci numbers have the property that every number after the first two is the sum of the two preceding ones^[wiki]. The formula for computing the n^th term in a Fibonacci Sequence can be expressed in terms of a recursive definition as :

Write a program that implements a recursive function for computing the n^th term of a Fibonacci Sequence.

In the main method of your program accept the value of n from the user and then call your fib function with this value.

On a piece of paper show the tree visualization of the function calls when fib(5) is called.

If n = 0. If n = 1. 1, 1, fib(n -1) + fib(n -2) otherwise. fib(n) =