Refer to function fox below when answering Question.
```
int fox
(int m, int n)
{
int ans;
if (m < 10)
if (n < 10)
ans = m + n;
else
ans = fox (m, n-2) + n;
else
ans = fox (m-1, n) + n;
return ans;
}
```
What is the value of fox (11, 11); ?
a. 18
b. 29
c. 39
d. 51
e. 0
d. 51
Computer Science & Information Technology
You might also like to view...
Combining two or more cells in a Quick Table is completed by clicking the ________ button
A) Split Cells B) Merge Cells C) Banded Columns D) Autofit
Computer Science & Information Technology
The time complexity of the function seqSearch in an array list is O(n2).
Answer the following statement true (T) or false (F)
Computer Science & Information Technology