Can the leaves of an ordered rooted tree have the universal address 1.1, 1.2.1, 1.2.2, 1.2.3, 2.1, 2.2.1, 2.3.1, 2.3.2, 2.4.2.1, 2.4.2.2, 3.1, 3.2.1, 3.2.2? if so, identify such an ordered rooted tree.

∠1≅∠2 by the alternate exterior angles theorem.

step-by-step explanation:

given, a ∥ b and ∠1 ≅ ∠3 .we have to prove that e ∥ f

we know that ∠1≅∠3 and that a || b because they are given. we see that by the alternate exterior angles theorem. therefore, ∠2≅∠3 by the transitive property. so, we can conclude that e || f by the converse alternate exterior angles theorem.

we have to fill the missing statement.

transitivity property states that if a = b and b = c, then a = c.

now, given ∠1≅∠3 and by transitivity property ∠2≅∠3 .

hence, to apply transitivity property one angle must be common which is not in result after applying this property which is ∠1.

the only options in which ∠1 is present are ∠1 and ∠2, ∠1 and ∠4

∠1 and ∠4 is not possible ∵ after applying transitivity we didn't get ∠4.

hence, the missing statement is ∠1≅∠2.

so, ∠1≅∠2 by the alternate exterior angles theorem.

18

step-by-step explanation:

draw the shape and you will see that f and k are actually at adjacent vertices (points of the hexagon that are neighboring).   so find the distance between (1,2) and (4,2).   that is easy since (1,2) and (4,2) is just a vertical distance to count, which is 3.   it is a regular polygon which means all sides are congruent.   you have 6 sides (hexa) so multiply 6 by 3 to receive 18.