Computer Science. C Language. Summations.

2) (10 pts) ANL (Summations and Algorithm Analysis) Find the closed form solution in terms of n for the following summation. Be sure to show all your work. 3n n-2 >> ; this how does turn into this that? - - 2)(n-1) 3n-n+1)n 2)(n 1) 9 (2n + 1)(n-2)(n-1) In the second step, we are summing a constant with respect to the summation index i, thus we can simply multiply the item being summed by the number of times it's summed. Note, also accepted is the polynomial multiplied out: 2n3 - 5n2 +n + 2 Grading: 5 pts for solving the inner summation, 5 pts for then solving the outer summation, grader decides partial credit within each part. Summation Formulas : n(n+1) 2 n(n+1)(2n+1) ZP-1 c = cn Em-, i = n(n+1) , LT-4 12 = n(n+1}{2n+1) EP-1 13 = n*(n+1)*, LT=0 x1 = thg 12