see below for sumNumbers method

int sumNumbers(int n){

int sum = 0;

for(int i = 1;i<=n;i++){

sum += i;

}

return sum; }

a)Identify the stopping condition(s) and the return value, if any, for method sumNumbers. What is the base case for sumNumbers?

b)Determine the size-m problem (i.e. the subproblem) for the method sumNumbers. What is the recursive call?

cHow is the size-n problem constructed from the size-m problem?