In this exercise, our goal is to implement a method called sumNumbers that takes the sum of the first n positive non-zero integers. By definition, the sum of the first one numbers will be 1.

1-Using the fantastic four approach, determine the size-n problem (i.e. the whole problem) for the method sumNumbers. What is the method signature for sumNumbers?

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

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

4-How is the size-n problem constructed from the size-m problem?

5-

Give a recursive implementation of sumNumbers. A method signature is given below.

//TODO: implement recursive sum implementation. public class RecursiveSum { public static int sumNumbers(int n) {

6-Would you consider the fantastic four approach helpful? Why or why not? Could you apply this method to any recursive problem? (This is an opinion question - provide a clear argument for full credit.)