(a) Design a recursive algorithm for computing n 2 for any nonnegative integer n that is based on the definition

n^2 = 0 if n = 0

=(n 1)^2 + 2n 1 if n > 0 .

Your algorithm should minimize the number of required multiplications

(b) How many multiplications does your algorithm perform in the computation of 13^2