Write a recurrence equation for a multiplication algorithm that squares any n-digit number by dividing the n-digit number into three parts, each comprised of n/3-digits. this way you are reducing the operation to multiplying six n/3-digit numbers. you mat assume n to be "nice". solve the recurrence equation using the recursion tree approach to find the exact number of multiplications and additions to find the square of a number. you may represent an atomic multiplication between two, one-digit numbers, as µ and the atomic addition of two, one-digit numbers, as α.