Consider the following recursive function: int Func(int num) { if (num == 0) return 0; else return num+Func(num+1); } 1. Is there a constraint on the values that can be passed as a parameter for this function to pass the smaller-caller question? 2. Is Func(7) a good call? If so, what is returned from the function? 3. Is Func(0) a good call? If so, what is returned from the function? 4. Is Func(-5) a good call? If so, what is returned from the function?

No written by hand solution

Question: First write a function mulByDigit :: Int -> BigInt -> BigInt   which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1]   Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt   Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] []   Your implementation should not be recursive.     Code:  import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…

Prepare the SPIM program for the  function: int fun(int n) {   int i,f=1;   for (i=n; i>0; i--)     f=f+1;     return f; }

write JavaScript function utilizes the arrow function expressio accepts nfinite number of parameters,parameter values are integersreturns the sum of all the parametersthe returned total is to be assigned to a variableassumption: all parameter values are integers

Add 3 parameters to each function in the code below.  ********************************************* Code starts here ************************************************** Module.py    #Defination to sort the list def sort(listNum):     sortedList = []     #While loop will run until the listNum don't get null     while(len(listNum) != 0 ):         #Set the min as first element in list         min = listNum[0]         #iterate over the list to compare every element with num             for ele in listNum:             #If element is less than min             if ele < min:                 #Then set min as element                 min = ele         #append the sorted element in list         sortedList.append(min)         #Remove the sorted element from the list         listNum.remove(min)         return sortedList #Function to find the sum of all elements in list def SumOfList(listNum):     #Set the sum as zero     sum =0     #Iterate over the list to get every element     for ele in…

Describe the parameters of function pow.

Given the following functions:void sum(int a, int b, int total) {    total = a+b;}int main() {    int x=1, y=2, s=0;    sum(x,y,s);    cout << s << "\n";    return 0;}1. Explain the problem with the sum function.2. Explain how to fix the problem without changing the main function.

Study the following definition of function "Secret" and answer the question below. int Secret (int numl, int num2) if (numl 0) 0; i <= num2; i++) + i; for (int i numl = numl return num%3; return 0%3; What is the output of the following code segment? cout<

Plans Resources More - Overview Question 3 Consider the following function: int func(int x){ if (x == 0) %3D return 2, else if (x == 1) return 3; else return (func(x - 1) + func(xF 2)); What is the output of func(4)? Your answer: O13