(Using the programming language C, answer the following question) Write recursive C functions to do the following: Example: int summ(int n) returns the summation of integers from 0 to n. Here is the code. int summ(int n) { if(n < 0) return -1; if(n == 0) return 0; return n + summ(n - 1); } 1) If n is less than 0, the expression int bunnyEars(int n) returns -1; otherwise, it returns the number of ears for n bunnies. int factorial(int n) returns -1 if n is less than 0, otherwise returns the factorial of n. If n is greater than or equal to 0, the expression int fib(int n) returns -1; otherwise, it returns fib of n - 1 + fib of n - 2. (This will run quite slowly if you test it with more than roughly 50 digits.). int posPow(int base, int exp) returns -1 if exp is less than 0, otherwise returns base raised to the power exp. Write a main() that tests all the other functions thoroughly.

(Using the programming language C, answer the following question)

Write recursive C functions to do the following:

Example:

int summ(int n) returns the summation of integers from 0 to n. Here is the code.

int summ(int n) {
if(n < 0) return -1;
if(n == 0) return 0;
return n + summ(n - 1);
}

1) If n is less than 0, the expression int bunnyEars(int n) returns -1; otherwise, it returns the number of ears for n bunnies. int factorial(int n) returns -1 if n is less than 0, otherwise returns the factorial of n. If n is greater than or equal to 0, the expression int fib(int n) returns -1; otherwise, it returns fib of n - 1 + fib of n - 2. (This will run quite slowly if you test it with more than roughly 50 digits.). int posPow(int base, int exp) returns -1 if exp is less than 0, otherwise returns base raised to the power exp. Write a main() that tests all the other functions thoroughly.