For a proof by induction of the math statement below, identify the correct step for proving the theorem is true for n = k + 1.
1+3++(2n-1)=n^2

If , then is true.

Suppose the equation holds for , so that

Then if , we have

as required, so the equation holds for all .

c

c

c

c

c

c

c

cc

c

step-by-step explanation:

step-by-step explanation: