Please answer number 3 using Mathematica

The Fibonacci numbers F(n) are determined by the following recursive relation F(0) 0 F(1) 1 F(n) F(n-1)+F(n-2) for n> Use Mathematica to give a recursive definition of the Fibonacci numbers: see the Mathematica documentation on how to define functions in MathematicaB, and see also this further documentation giving an example of a recursively defined function. 1. 2. From the recursive definition, compute FI2], F[3], FI4] and FI5]. 3. Calculate and plot F(n) for 0Sn s 20