Please Show the Base Case, and Recursion Case Thank You.

No helper functions or Auxiliary functions. You must use recursion. Use magic functions. Your code must be such that if we insert it into a suitable test framework with a main routine and appropriate #include directives, it compiles. Here is a function, with descriptions of what they are supposed to do. They are incorrectly implemented. Replace the incorrect implementations of these functions with correct ones that use recursion in a useful way: your solution must not use the keywords while, for, or goto. You must not use global variables or variables declared with the keyword static, and you must not modify the function parameter lists. You must not use any references or pointers as parameters except for the parameters representing arrays. //Returns the product of two positive integers, m and n, //l using only repeated addition. int mult(unsigned int m, unsigned int n) { return -1;//This is incorrect.}