Prove the following statement using induction. “For all inte…
Prove the following statement using induction. “For all integers n ≥ 2, n2 ≥ n+1. ” Use good proof technique. Grading rubric:1 pt. State the basis step, then prove it.1 pt. State the inductive hypothesis.2 pt. Complete the proof of the inductive step.1 pt. State the final conclusion at the end of the proof.1 pt. Label each part: the basis step, inductive hypothesis, inductive step, and conclusion. Note: To avoid the need for typing superscript exponents, you may use the expression ‘n^2’ to represent n2. Also the ≥ symbol can be written as >=.