I don’t really understand how recursion works in this exercise. does recursion work with sum too? because in the example is with *

How can sum([1], 0) should equal 0?
How can sum([2, 3, 4], 1) should equal 2?
How can sum([2, 3, 4, 5], 3) should equal 9?

Your code so far

function sum(arr, n) {
// Only change code below this line
if (n <= 0) {
return 0;
}else {
return sum(arr, n - 1) + arr[n-1];
}
// Only change code above this line
}

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/80.0.3987.163 Safari/537.36.