Please answer #2 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>1 na 1. Use Mathematica to give a recursive definition of the Fibonacci numbers: see the Mathematica documentation on how to define functions in Mathematica, and see also this further documentation giving an example of a recursively defined function From the recursive definition, compute FI21, F[3],F[41 and FI5] n ae 2