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 8 in 8,420 is in the thousands place so it's value is 8 thousand.

the 8 in 6,870 is in the hundreds place so it's value is 8 hundred.

divide 8000 by 800 to find the answer:

8000 / 800 = 10

the 8 in 8,420 is 10 times greater than the 8 in 6,870

answer: 75°

step-by-step explanation:

∠esk is the supplement of ∠edk, so is 100°. ∠esd = 1/2·arc ed, so is 25°.

since ∠esk = ∠esd + ∠dsk

you have 100° = 25° + ∠dsk . .

fill in known values 75° = ∠dsk . . . . .

subtract 25°

step-by-step explanation:

my name jeff

step-by-step explanation:

natural disasters at one point james charles' career