In Haskell: Write the power :: Integer -> Integer -> Integer function for integers without using the exponentiation operator. Code this function first without recursion and then with recursion.

In Haskell: Code a function "rangeProduct" that computes according to the following examples . Return 0 if the second argument is smaller than the first. What to do for negative numbers to do (if anything) is up to you. Write the program without recursion first and then write it with recursion. rangeProduct 3 5 --> 3*4*5 rangeProduct 5 3 --> 0 rangeProduct 6 12 --> 6*7*8*9*10*11*12 rangeProduct 4 4 --> 4

Write a recursive function double recSum(double array[], int count); that takes an int argument and returns the sum of count array entries. C++, please explain how the code works.

In C++ fill in the blanks

C++

In C++ Consider the following recursive function (Chapter 17, #9, modified) void recFun(int x) { if (x > 10) { recFun(x / 10); cout<< x % 10; } else cout<< x; } How can the code be modified so that the sum of all digits is printed?

Please answer in c++

Do the following in Haskell and show type signature!: (Also show full code on how to execute the program including an example) Write a recursive function to count the number of items in a list for example: cntItems [2,5,6] = 3

*In C program, what is wrong with the following function? int integer_add( int x, int y, int z ) { int sum; sum = x + y + z: return sum; }

1. You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. 2. Trace your function and call. Remember that you must keep track of memory for each function call and provide output. How would I trace a function? and keep track of its memory for each function call?