The following function computes the sum of the first n? 1 integers. Show how this function satisfies the properties of a recursive function.

```
/** Computes the sum of the integers from 1 through n.
@pre n > 0.
@post None.
@param n A positive integer
@return The sum 1 + 2 + . . . + n. */
int sumUpTo(int n)
{
int sum = 0;
if (n == 1)
sum = 1;
else// n > 1
sum = n + sumUpTo(n - 1);
return sum;
} // end sumUpTo

```

The product of n numbers is defined in terms of the product of n- 1 numbers, which is a smaller problem of the same type. When n is 1, the product is anArray[0]; this occurrence is the base case. Because n ? 1 initially and n decreases by 1 at each recursive call, the base case will be reached.