consider the following weighted graph. use prim’s algorithm starting with vertex a to find a minimum spanning tree for the graph, and indicate the order in which edges are added to form the tree.
a)order of adding the edges: {a, e}, {b, e}, {c, d}, {b, c}, {d, f}, {f, g}
b)order of adding the edges: {a, e}, {b, c}, {c, d}, {d, f}, {f, g}, {b, e}
c)order of adding the edges: {a, e}, {f, g}, {b, c}, {c, d}, {d, f}, {b, e}
d) order of adding the edges: {a, e}, {b, e}, {b, c}, {c, d}, {d, f}, {f, g}

the mistake in the pattern is that :

b. the decimal point was moved one too many place values each time

the correct pattern could be made by :

b. moving the decimal point to the right the same numbers of place values as the exponents

i dont know if you cant find a way its best to actually add all of them start from 105 tho

step-by-step explanation:

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.