Write a recursive algorithm to multiply two positive integers m and n using repeated addition. Specify the base case and the recursive case.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.