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$

$()=/!$

$"$

#$$\%$