How does this recursive walk behave for very large `n`?

function sum(n, acc = 0) { if (n === 0) return acc; return sum(n - 1, acc + n); } sum(1_000_000);