Using C++ Language Only. Please follow the knowledge given

Purpose: To investigate recurrence relationships and summations by creating a program to compute the nth Fibonaccci number and the sum of all numbers up to another given value. Requirements: Create a program in Java, C, or C++ 1. Read in an integer number 2. Compute and display the corresponding Fibonacci number using a recursive algorithm (NOTE: display only the number, not the sequence) 3. Read in a second integer 4. Compute and display the summation of all the values from one to that element, comparing the result to the formula 2n(n+1) A. Use a loop to find the sum of all the numbers from 1 to n, then compare it to the result of the formula above B. If they are the same say they are the same, if they are different, report that The recursive algorithm for Fibonacci: fibo (n) if (n