Let an algorithm has complexity s(n)=s(n1)+f(n) where k=1,2,3, f(k)=k2+k/2 (1.) Find the closed form for s(n) if s(2)=2 (2) Prove by mathematical induction