How many base cases are in the functionabove?
a. 0
b. 1
c. 2
d. 3
int func2(int m, int n) {
if (n == 0)
return 0;
else
return m + func2(m, n-1);
}

The answer is (b). 1.

Explanation:

In the code there is only 1 base case .

the base case is as following:-

if(n==0)

return 0;

this is the base case.

Base case is the most important statement in the function that uses recursion because without base case the recursion calls will keep on going and we will get a run time error.

$X = $12y

Step-by-step explanation:

In this question, we are asked to give an expression to represent the amount of money charged to a man who stayed in a motel for a particular number of days.

Firstly, we need to know the amount of money charged per day. This is visible from

the question and it is equal to $y.

Secondly, the number of days/night stayed is 12 days. This means that the amount of money he was charged is 12 * y = $12y

Since the amount of money charged is equal to $x, the amount to pay can be expressed in terms of y and x to be

$X = $12y