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 this goal. Explain what tool you used as an aid in identifying a transformation sequence.

Raj encoded a secret phrase using matrix multiplication. using a = 1, b = 2, c = 3, and so on, he multiplied the clear text code for each letter by the matrix to get a matrix that represents the encoded text. the matrix representing the encoded text is . what is the secret phrase? determine the location of spaces after you decode the text. yummy is the corn the tomato is red the corn is yummy red is the tomato