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 may 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 α.

pentagon

step-by-step explanation:

the coordinates   a(5, -2), b(3,-1),c(-4,-4) d(-3,8) and e(-1,4) forms the vertices of the polygon when they are connected in order.

in order to classify that which polygon is it with the given coordinates, first count the number of vertices and then count the number of sides it can make with these vertices.

since, the given coordinates have five vertices, therefore, it will make five sides. moreover, pentagon is regular in nature therefore it will be convex.

now, a polygon with five sides is known as pentagon, therefore, the given polygon is the pentagon.

1. 3. can also be expressed as (22/7)

2. -4.5

3. 3.6

happy to

pls mark as brainliest

this is the formula: v = the value of investment at the end of the time period

p = the principal amount (the initial amount invested)

r = the annual interest rate

n = the annual frequency of compounding (how many times a year interest is added)

t = the number of years the money is invested

^ means raise to the power of