Write a program that recursively and iteratively counts down from n. a) Create a void recursive function named countDownR() that accepts an integer n, and progressively decrements and outputs the value of n. b) Create a void iterative function named countDownI() that accepts an integer n, and progressively decrements and outputs the value of n. c) Trace the function when n is 5. Example Output 5 4 3 2 1 0

MULTIPLE FUNCTIONS AND RECURSIVE FUNCTIONS HANDS-ON use #include<stdio.h>

Given the following recursive function and main(), what is the required conditional statement that would result in the following output: 3 2 1 Goooo! recursive function and main is below this line

1.Please use recursive function principle and use Visual Studio or Xcode to create a function called: f (int n), which will be calculated based on following formula: f (n) = [1+f (n-1)] *2 f (0) = 0 2. Please design another function called fibonacci function: fibonacci (int n), which will be calculated based on following formula: fibonacci ( int n) = fibonacci (n-1) + fibonacci (n-2) fibonacci (0) = 0 fibonacci (1)=1 3. Please copy and paste your source code here. You don't need to compile and execute your source code. The format will be like: #include <iostream> #include <cmath> using namespace std; int f ( int n) { } int fibonacci ( int n) { }