A triangle has vertices at B(-3,0), C(2,-1), D(-1,2). Which series of transformations would produce an image with vertices B“(4,1) C“(-1,0), D“(2,3)

one that is bigger than 3 1/2

the sum of the lengths of any two sides of a triangle is greater than the length of the third side. if you take the three sides of a triangle and add them in pairs, the sum is greater than (not equal to) the third side. if that is not true, then it is not possible to construct a triangle with the given side lengths.

step-by-step explanation:

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol