a. Use the formulas 2, Sn =Sn-1 +2n, for all n 2, to write a recursive algorithm that computes s 2+4+6+ ...+2n b. Give a proof using mathematical induction that your algorithm in part a is correct