for the input from input from $0$ to n$,$give the execution taken and solve it by C programming.a$.$ Implement a recursive algorithm to compute Fibonacci numbers $(1,1,2,3,5,$

$8,$dots based on the recurrence relation. Create a recursive function that takes

an integer $n$ as input and returns $F(n).$

b$.$ Now, compute $F(n)$ using a for loop, and compare the execution time with the

previous method.

Analysis:

Measure the execution time of the recursive Fibonacci algorithm for varying values of

$n$ and record the time taken to compute $F(n)$ for each $n$ in a chosen range.

Plot the Fibonacci term $(n)$ on the $x-$axis and the execution time on the $y-$axis.

This is to help analyze the algorithm's efficiency and its time complexity growth with

n$.$