Requirements: Code the following functions using NON-RECURSIVE ITERATION and then using RECURSION, test them by calling them from a simple interactive main menu with different values; overall you should have one program containing one main and 16 other functions (8 recursive, 8 non-recursive)where the functions are called based on an interactive user menu:

For each function write both function PROTOTYPE and DEFINITION for every function. You MUST completely document every function following this basic format: /* Line1: Describe the function/its purpose briefly

Line2: Describe the input parameters, or the assumptions/requirements going into the function

Line3: Describe the output of the function. (what does it return? what does it print?) */ 1. Function fun1(n) is defined as follows

i =1+2+3+...+n

2. Function fun2(n) is defined as follows

(i+1)^2 = (1+1)^2 + (2+1)^2 + ... + (n+1)^2

3. Fibonacci(n) = Fibonacci(n-1) + Fibonacci(n-2); Where n is a positive integer n >= 0 and Fibonacci(1) = 1; Fibonacci(0) = 0; 4. The gretest common divisor gcd(x,y) where gcd(x, y) = x, if y=0 otherwise gcd(x, y) = gcd(y, x MOD y), if y > 0 .

5. The function Power(a,b), where Power(2,4) = 2 * 2 * 2 * 2

6. A function to display (print) that displays all the positive integers that are less than the value of n and divdisable by m, where m

7. DrawTriangle(n); Would display one * on the first line, then one more each line until it displays a line with n *s.

Example: DrawTriangle(4) would display:

*

**

***

****

Note: in any recursive function implementation you are not allowed to use any iterative statement. In other words, you can not use for-statement, while-statement, or do-while statement.

Transcribed image text