Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1? 3, –6, 12, –24, 48, … a. f(n + 1) = –3 f(n ) b. f(n + 1) = 3 f(n ) c. f(n + 1) = –2 f(n ) d. f(n + 1) = 2 f(n)

step-by-step explanation:

wrgasadvauoyfaiua-00uhf

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.