C++

Question 2: (5 points) Write a C++function Fib that accepts a positive integer number n and commutes the nth Fibonacci number recursively The recursive definition of a Fibonacci number is F(n) = F(n-1) + F(n-2), where F(O)-1 and F(1)-1