Search for question
Question

3. Write a recursive function that returns the nth number in Fibonacci series. But instead of

addition of previous 2 numbers, the function will take a code block and apply the code

block to the previous 2 numbers. So the regular fibonacci series is a special case where the

code block specifies summation.

Fig: 1