Part $2$: Writing A Short C Program

With the pi$-$cluster successfully configured, $($Did that take a while? Take a break if you want to$.)$

we now move on to writing our first $C$ program in this course.

The Fibonacci sequence is a well known recursive sequence, where each term is obtained by

summing the two previous terms. The sequence starts with two fixed terms, $0$ and $1.$ In this

section, we will assume that the Fibonacci sequence is $0-$indexed.

If we let $F_n$ be the $n^{th}$ term in the fibonacci sequence, then we can say:

$F_0=0$ for $n=0$

$F_1=1$ for $n=1$

$F_n=F_{n-1}+F_{n-2}$ for $n>1$

For example: $F_2=F_{2-1}+F_{2-2}=F_1+F_0=1+0=1.$

$($For a longer list of Fibonacci numbers, see this page. You can use it to check your results.$)$

In this part of the assignment, you will be completing the implementation of a $C$ function that

returns the $n$th term of the Fibonacci sequence, where $n$ is given as a parameter.