Please show work. No credit for an answer obtained by running a program. Write parts of a program only where requested. Show how you got each answer. Do the work by hand. Please clearly number each problem answer and work. n(n+1) 16) Use mathematical INDUCTION to prove that k = 1+2+ ...n 2 If this is true for a given n, then induction shows it is true for n+1 and therefore true for all integers values of n