Arrange the given steps in the correct order to prove that 1-2 23 fis true for all n> o using the concept of mathematical induction (1) rank the options below +.. t 2-3 a(k+2)+1 (+1)(+ 2) therefore, we have (+1)(k+2) we have completed both the basis step and the inductive step, so, by the principle of mathematical induction, the statement is true for every positive integer n 1 for n 1, the left-hand side of the theorem is and the right-hand stde assume that for some k> o k+1 1-2 2-3 (k+1) by adding (+1)(+2) 1 on both the sides, we + 1-2 2-3 k(k+1) (k+1)(k+2) k+1 (k+1)(k+2)