1. The problem statement, all variables and given/known data Prove by induction that n2>(4n+7) for all integers n[tex]\geq[/tex]6. [Hint: somewhere you may use the fact that (2k+1)[tex]\geq[/tex]13 > 4.] 2. Relevant equations 3. The attempt at a solution n2> (4n+7) (B) when n =6 62> (4*6+7) 36>31 true (I) given n=k then k2> (4k+7) let n=k+1= k2+2k+1 (k2+ 2k+1) > 4k+7 +2k+1 4k+7+2k+1> 4k+7+4 6k+8 > 4(k+1)+7 Is that looks like okay? Please help. Thank you.