Write a recursive method that will compute cumulative sums in an array. To find the cumulative sums, add to each value in the array the sum of the values that precede it in the array. For example, if the values in the array are [2, 3, 1, 5, 6, 2, 7], the result will be [2, (2) + 3, (2 + 3) + 1, (2 + 3 + 1) + 5, (2 + 3 + 1 + 5) + 6, (2 + 3 + 1 + 5 + 6) + 2, (2 + 3 + 1 + 5 + 6 + 2) + 7] or [2, 5, 6, 11, 17, 19, 26]. Hint: The parenthesized sums in the previous example are the results of a recursive call.

What will be an ideal response?

```
public static void cumulativeSum(int data[]){
cumulativeSum(data, 1);
}

public static void cumulativeSum(int data[], int n) {
if (n == data.length)
return;
else {
data[n] += data[n-1];
cumulativeSum(data, n+1);
}
}
```

This code is in Methods.java.