Need help with the following Problem!
Write a recursive function that takes one parameter n (n>0) of type int and returns
the nth Fibonacci number. Example of Fibonacci numbers: F(1) is 1, F(2), is 2, F(3) is 3, F(4) is 5, and in general
#include
using namespace std;
int Fibonacci(int);
int main()
{
int input;
cout << "Please enter a positive integer number:";
cin >> input;
cout << "Fibonacci(" << input << ")=" << Fibonacci(input) << endl;
return 0;
}
int Fibonacci(int n)
{
//Your code goes here
//This must be a recursive function
}