Consider the following recursive function:

This recursive function generates the following sequence:

$7,26,83,154,....$

Create a recursive program that asks the user to enter a positive integer N and then displays the value $($the value of the Nth term in the sequence$).$

For example, if the user enters $3$ the output is $83($the $3$rd term in the sequence$).$ If the user enters $5,$ the output is $767($the $5$th term in the sequence$).$

Hint:$$ To build the recursive module, start at the beginning of the sequence and build up to the term you need.$$ That is$,$ use the value of f $(2)$ to find f $9(3),$ then use the value of f $(3)$ to find f $(4),$ and so on$.$

Note:$$ For full credit:

You must use recursion $($i$.$e$.$ a recursive module$)$ to create this program.$$ If you use a loop instead of recursion for this program you will receive $0$ for this problem.

You must use parameters to pass information to the module.$$

The inputs and outputs must include appropriate sentences.