Answer:
5/9
Step-by-step explanation:
divide 25 by 5 and 45 by 5
Answer:
f(x) ≤ -5
Step-by-step explanation:
It should be the last one , 8
hope this helped have a good day :)
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.
