Given a number n, print n-th Fibonacci Number
. The first two Fibonacci numbers are 0 and 1. Every other number is the sum of the two preceding ones, i.e. Fib(n) = Fib(n−1) + Fib(n−2).

Write a recursive function template and an iterative function for printing nth Fibonacci number in C++14 and above.
Example:
n = 7 -> output: 13


#include <iostream>

long long fib_recursive(int n){
    if(n <= 1
using recursion:

Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, ...

Contraints:
1 <= n <= 10^6
Time Limit: 1 sec

Example:
Input:
n = 5

Output:
Fibonacci(5) = 5

Input:
n = 10

Output:
Fibonacci(10) = 55

// Hint:
// Write a recursive