Note: Write all functions in Scala using a strict functional paradigm.

Question 4 .a The Fibonacci sequence is one of the most famous sequences in mathematics The first 2 Fibonacci numbers are fi 1 and f2 1. The nth Fibonacci number is then defined as fn- fn-1+fn-2. Write a recursive function that calculates the nth Fibonacci number. 4.b There is another way to compute the Fibonacci numbers. Suppose we have a function FibHelp(i, a, b) that has the following property FibHelp(i, fib(n), fib(n +1))- fib(n+i) The above is a property that the function satisfies, not the actual definition! You are required to give a recursive definition of the FibHelp function that satisfies this property, implement it and then use it to compute the nth Fibonacci number Hint: What does the property say about the function when i 02)