$3\mathrm{.}9$ LAB: Fibonacci sequence $($recursion$)$

The Fibonacci sequence begins with $0$ and then $1$ follows. All subsequent values are the sum of the previous two, for example: $0,1,1,2,3,5,8,13.$ Complete the fibonacci$()$ function, which takes in an index $($starting at $0),$ n$,$ and returns the nth value in the sequence. Any negative # TODO: Write recursive fibonacci$()$ function

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

start$\_$num $=$ int$($input$())$

print$($f$\text{'}$fibonacci$(\{$start$\_$num$\})$ is $\{$fibonacci$($start$\_$num$)\}\text{'})$index values should return $-1.$ # TODO: Write recursive fibonacci$()$ function

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

start$\_$num $=$ int$($input$())$

print$($f$\text{'}$fibonacci$(\{$start$\_$num$\})$ is $\{$fibonacci$($start$\_$num$)\}\text{'})$