Computer Science Question:

Please make sure it's very clear and understandable. If it's good, I will give thumbs up 100%. Thanks.

Prove, using mathematical induction, that the SeriesSum function in the code below outputs n(n+1) for any positive integer n. #include ESO OCTA CON 3 int Series Sum(int n) { if (n == 1) return 1; else return (n*n*n) + Series Sum(n-1); int main() { int n; scanf("%d",&n); printf ("%d", Series Sum(n))