What is the base case for the recursive sum of first nnn integers?
sum(1)=1sum(1) = 1sum(1)=1
sum(n)=n+sum(n−1)sum(n) = n + sum(n-1)sum(n)=n+sum(n−1)
sum(0)=1sum(0) = 1sum(0)=1
sum(n)=n(n+1)/2sum(n) = n(n+1)/2sum(n)=n(n+1)/2