The Fibonnacci series 0,1,1,2,3,5,8,13,21,... begins with the terms 0 and 1 and has the property that each succeeding terms is the sum of the two preceding terms.
a) Write a non-recursive function that calculates the n'th Fibonacci number.
b) Write a recursive function that calculates the n'th Fibonacci number.