The Fibonacci numbers is a sequence of numbers F₁: 0 1 1 2 3 5 8 13 21 34 ... where Fo is 0, F₁ is 1, F₂ is 1, F3 is 2, and so on. A recursive definition is: Fo = 0 F₁ = 1 Fn = Fn-2 +Fn-1 if n > 1 Write a recursive function to implement this definition. This local function will receive one integer argument n, and it will return one integer value that is the nth Fibonacci number. Note that in this definition, there is one general case but two base cases. Then, test the function by printing the first 20 Fibonacci numbers.

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set o…