I really need help please this problem is very confusing for me it is in C++ The Fibonacci sequence:unsigned fibonacci (unsigned n, unsigned& recursions);void fibonacci(unsigned f[], unsigned n);The first function is to solve the problem recursively and return the Fibonacci value of n as theresult. In addition, it shall store the number of recursive calls in the recursions parameter.For example, assume recursions is an unsigned int variable in main() and is set to 0 beforeeach of call to the fibonacci function.Calling fibonacci (0, recursions) should return 1 and store 0 in recursions sincethere is no need for recursive call.●Calling fibonacci (2, recursions) should return 2 and store 2 in recursions sincethis call would have trigger two recursive calls: fibonacci (0, recursions) andfibonacci (1, recursions).Calling fibonacci (3, recursions) should return 3 and store 4 in recursions sincethis call would first trigger fibonacci (2, recursions) and fibonacci (1,recursions). In addition, fibonacci (2, recursions) would trigger fibonacci (1,recursions) and fibonacci (0, recursions).The second function is to create the first n values of the Fibonacci sequence and store them inthe array parameter using an iterative approach. Do not use any nested loop. For example,assume results is an array of unsigned int.Calling fibonacci (results, 5) should store {1, 1, 2, 3, 5} in the first five elements ofresults.Calling fibonacci (results, 10) should store {1, 1, 2, 3, 5, 8, 13, 21, 34, 55} in the firstten elements of results.

Dear Student, The complete code with required functions is given below -#include <iostream>using namespace std; // Recursive function to calculate fibonacci of nunsigned fibonacci(unsigned n, unsigned& recursions){ // Increment the recursion counter recursions++; // Base case if (n == 0 || n == 1) return 1; // Recursive case return fibonacci(n - 1, recursions) + fibonacci(n - 2, recursions);} // Iterative function to generate the Fibonacci sequencevoid fibonacci (unsigned f[], unsigned n){ f[0] = 1; f[1] = 1; for (unsigned i = 2; i < n; i++) f[i] = f[i - 1] + f[i - 2];} int main() { // Test recursive function unsigned recursions = 0; cout << fibonacci(3, recursions) << endl; cout << "Number of recursions: " << recursions << endl; // Test iterative function unsigned f[10]; fibonacci(f, 10); for (int i = 0; i < 10; i++) cout << f[i] << " "; cout << endl; return 0;}