Code:// recursive fibonacci function #include <iostream> using namespace std; long fibonacci ( long ); int main() { long result, number; cout << "Enter an integer: "; cin >> number; result = fibonacci( number ); cout << "Fibonacci(" << number << ") = " << result << endl; return 0; } // Recursive definition of function fibonacci long fibonacci( long n ) { if ( n == 0 || n == 1 ) // base case return n; else return fibonacci( n - 1 ) + fibonacci( n - 2 ); } // number entered was 5 // return fibonacci( n - 1 ) + fibonacci( n - 2 ); // next return 4+3 = 7? // i'm confused now anyone point out my misunderstandings? // thank you.