Code to be done in R. This is done for studying purposes to clarify, not to be submitted for grading.

Recursive Fibonacci Sequence Continuing to work with the Fibonacci sequence, write a new function to perform the same task but using recursion. A recursive function is one which calls itself. This algorithmic technique is often used when the problem can be broken down into smaller problems which can can be solved in a similar manner. Be careful of how your function is written, you will need to include a stopping condition for when the problem has been broken down far enough and you're ready to find the solution. If you are unfamiliar with recursion, it may be helpful to consider this example for calculating the factorial of a natural number, n. Recall that the factorial is given by 11!: n X (n 1) X (n 2) X - -- X 3 X 2 X 1. Here's a recursive R function which returns the factorial of a number. factorial