Whichalgorithm would you recommend be used to find the fastest route from the distribution center to each of the towns? Demonstrate how it would work on the example above if the distribution center is placed at town G. Show the resulting routes.

answer: sine

step-by-step explanation:

the answer is 1 becuz if it were 1.0 that would rip apart the entire so ya. : )

~potato.

copyright potato 2019.

answer:   the paragraph proof is mentioned below.

step-by-step explanation:

given: in a δxwy where

such that, ∠wzx ≅ ∠yzx and zw≅zy

we have to prove that: segment zx is a perpendicular bisector of segment wy.

prove: since, zw≅zy ⇒ ∠wzy is a supplementary angle.

then, ∠wzy= 180°

⇒∠wzx + ∠yzx = 180° ( because xz divides ∠wzy into two parts)

but, ∠wzx ≅ ∠yzx ( given)

⇒∠wzy+∠wzy=180° ( by substitution)

⇒2∠wzy=180°

⇒∠wzy=90°

⇒∠wzy=∠yzx =90°

therefore, xz⊥wy where wz=zy

⇒zx is a perpendicular bisector of wy.