Which expression represents the sum of the first nnn integers using recursion?
S(n)=n+S(n−1)S(n) = n + S(n-1)S(n)=n+S(n−1)
S(n)=n⋅S(n−1)S(n) = n \cdot S(n-1)S(n)=n⋅S(n−1)
S(n)=S(n−1)+n2S(n) = S(n-1) + n^2S(n)=S(n−1)+n2
S(n)=2S(n−1)S(n) = 2S(n-1)S(n)=2S(n−1)