(a) Devise a recursive algorithm using design by induction for computing n2 where the input to the algorithm n is a nonnegative integer. Hint: Use the fact that (n + 1)2 = n2 + 2n + 1. (b) Discuss the...

(a) Devise a recursive algorithm using design by induction for computing n2 where the
input to the algorithm n is a nonnegative integer. Hint: Use the fact that (n + 1)2 =
n2 + 2n + 1.
(b) Discuss the running time requirements of your algorithm.

Extracted text: (a) Devise a recursive algorithm using design by induction for computing n2 where the input to the algorithm n is a nonnegative integer. Hint: Use the fact that (n + 1)2 = n2 + 2n + 1. (b) Discuss the running time requirements of your algorithm.