Use Ocaml Language

Write a recursive function to calculate these numbers. It does not need to be tail recursive. Youve probably heard of the fibonacci numbers before, but in case you havent, theyre defined by the following recursive relationship:

f(0) = 0; f(1) = 1; f(n+1) = f(n)+ f(n1)