Prove the following statement using a proof by cases. [Hin…
Prove the following statement using a proof by cases. “For all non-negative integers n ≤ 2, n2 ≤ 2n.” Use good proof technique. Grading rubric:1 pt. State any givens and assumptions. 3 pt. Clearly identify the cases and prove each case.1 pt. State the final conclusion at the end of the proof. Note: To avoid the need for typing superscript exponents, you may use the expression ‘n-squared’ or ‘n^2’ to represent n2. Also the ≤ symbol can be written as