A.) Describe a series of at least two congruent transformations that will transform heptagon ABCDEFG into heptagon A’B’C’D’E’F’G’.

b.) There is more than one way to transform heptagon ABCDEFG into heptagon A’B’C’D’E’F’G’. Describe a second sequence of transformations that will accomplish

the discriminant is 64 + 4*1*12 = 112

this is prime.

step-by-step explanation:

answer: the distance

step-by-step explanation:

to calculate the distance d of a line segment with endpoints (x1, y1) and (x2, y2) use the formula d (x2 x1)2 (y2 y1)2. to calculate the midpoint of a line segment with endpoints (x1, y1) and (x2, y2) use the formula

answer:   35 % is the probability of a late departure or an early arrival.

step-by-step explanation:

let l represents the late departure and e represents the early departure.

then, according to the question,

p(l) = 12 %,   p(e) = 27 % and = 4 %

and, we have to find out,

but, we know that,

which is the required equation that will use to find the probability of a late departure or an early departure.

therefore,   the probability of a late departure or an early arrival =   35 %

graph b

step-by-step explanation:

one solution- graph a (clear intercepting point.)

no solution- graph b (they're parallel, there will never be a point of interception.)

infinite solutions- graph c (all points intercept.)