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 14 other functions (7 recursive, 7 non-recursive) where the functions are called based on an interactive user menu. Feel free to create any additional functions if needed. For each function write both function PROTOTYPE and DEFINITION for every function. You MUST completely document every function following this basic format: 1. Function fun1(n) is defined as follows > i=1+2+3+...+n 2. Function fun2(n) is defined as follows: = (1+1)? +(2+1)? +..+(n+1)? 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 ged(x, y) = x, if y=0 otherwise gcd(x, y) = godly, 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 bym, where man 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