Write a program to display the first $30$ terms of the Fibonacci series. First two terms of the series are $1.$ Each additional term is the sum of the two preceding terms. Use recursion to solve the problem and then explain why recursion is not a good choice. Note: I originally assigned the first $100$ terms, but this leads to numbers that are too big. Please use the following prototype for your function:

long long fib$($long long n$)$;

C$++$ please, using namespace std;