Devise a recursive algorithm for computing n2 where n is a nonnegative integer, using the fact that (n + 1)2 = n2 + 2n + 1. Then prove that this algorithm is correct.

Discrete Mathematics CS225 Terms and concepts: Week 2 Reading 145-159, 165-167. 183-184. 201-203 and Lectures and Supplemental Info List of Types of Numbers: • Natural numbers ( ℕ ): Counting numbers. {0, 1, 2, 3…} • Integers ( ℤ ): Positive and negative counting numbers. {…-2, -1, 0, 1, 2, …} • Rational numbers ( ℚ ): Numbers that can be expressed as a ratio of...