Answer:
39
Step-by-step explanation:
Kruskal's Algorithm has you add edges in order of weight, from least to greatest, excluding edges that form loops, until all nodes are connected.
__
Here, the edges have weights ...
5 -- AD, CE
6 -- DF
7 -- AB, BE
8 -- BC, EF
9 -- BD, EG
11 -- FG
15 -- DE
The edges shown in bold are ones that can be added without creating loops. Their total weight is 5×2 +6 +7×2 +9 = 39.
The weight of the minimum spanning tree is 39.
A) The legs are 9 & 12 inches.
B) The hypotenuse is 15 inches.
<em>Hope that helps! :) <3</em>
-8 and 7
-8×7=-56 and -8+7=-1
Correct answers are
B = y-2=2/3(x+3)
D = 2x-3y=-12
A = y=2/3x+4
she would make $7.50
