Develop a code snippet to address the following four scenarios and assess the

processing time across a range of inputs from $1$ to $50.$ Generate a graph representing

the processing time and elucidate the observation.

$1)$ Fibonacci $()($Recursive implementation$)(20$pts$)$

$2)$ Fibonacci $()($Iterative implementation$)(20$pts$)$

$3)()($Recursive implementation$)(20$pts$)$

$4)()($Iterative implementation$)(20$pts$)$

$()=\text{'}1=0,1$

$(1)+(2)>1$

$()=/!$

$"$

#$$\%$

An example of time measurement in C:

#include

clock$\_$t start, end;

double cpu$\_$time$\_$used;

start $=$ clock$()$;

$.../*$ HW$1($n$1),$ HW$1($n$2),.*/$

end $=$ clock$()$;

cpu$\_$time$\_$used $=(($double$)($end $-$ start$))$;

Note: you have the flexibility of selecting your language, but you should know your

syntactical requirements.

Note: your output may be in seconds $($ms$,$ us$,..)$ or CPU clocks.

Submission:

Create a directory with your name. Within this directory, include a PDF file

encompassing both the graph and its corresponding explanation.

Explain that: is there any significant difference between recursive and iterative

implementation? What is your guess about the time complexity of each one? $(20$pts$)$

Add your source code to your directory, zip your directory and submit your zip file

on canvas.