How can I prove that for each positive integer n, the sum of the first n odd positive integers is n^2 using induction?

Step1: check 
 (so true for first case) 

Step2:  check that  implies 
in this case...


true so we are done (it must be true for all n)