Mathematicians talk about the Fibonacci Sequence, which is a series of num- bers defined recursively. The first Fibonacci number is 0, and the second is 1. From there on out, the nth Fibonacci number is Fib(n) = F ib(n ? 2) + Fib(n ? 1). Write a function to input an integer index and then calculate that index value in the Fibonacci sequence.

Question

What will be an ideal response?

Answer 1

```
def Fib(index):
if index<=1:
return index
else:
return (Fib(index-2) + Fib(index-1))
```