Find the error(s) in the following recursive method, and explain how to correct it (them). This method should find the sum of the values from 0 to n.

```
public int sum(int n) {
if (n == 0) {
return 0;
}
else {
return n + sum(n);
}
}
```

The code above will result in infinite recursion, unless the value initially passed to the method is 0 (the base case). There is no code to make the recursive call on line 6 sim- pler than the previous call. The call on line 6 should decrease n by 1.