Algorithms Analysis & Design

Hi, Can I get the solution using C ++? Because I put the question previously and it was solved but did not attach the entire program as a whole. Thank you, can you explain the question? With its C ++ solution.

5.1 Finding the nth Term in a Geometric Sequence Write a code for finding the nth term in a Geometric sequence: 1, 3, 7, 15, 31, ..., n. That is, your code should accept an integer number, which indicates nth position in the sequence, and returns the value of the nth term in the sequence. For example, consider n = 6 (can be also written as S6), your code should return 127. Provide a single program consists of the following: Write a function called GeometricRecursive for the recursive version that takes the number of the position as an int argument. Hints: 1) Identify the base case for the GeometricRecursive function. 2) Let the GeometricRecursive function call itself, with proper arguments. Write a function called GeometricIterative for the non-recursive (iterative) version that takes number of position as an int argument. Write a main function that calls the two functions inside. You should have at least a couple of test cases included in the main function that shows the output for both functions. After implementing the recursive and non-recursive functions, you are supposed to perform two additional tasks. The first task is to analyze both approaches as follows: Establish the recurrence relations for the recursive approach. Solve the recurrence and provide the order growth. Establish the sum expression for the non-recursive (iterative) approach. Solve the sum and provide the order growth. The second task is to plot the running time of both approaches for different input sizes (n). To do that, consider ten input size (n) values: 10, 50, 100, 200, 400, 800, 2000, 4000, 8000, 10000. For better precision, run each value ten times and take the average of all ten runs for each case