Which is the cost of a minimum spanning tree of the weighted graph using Kurskal's Algorithm?
28
30
31
40

Answer:
The Answer is 30
Step-by-step explanation:
I took the quiz :)
Answer:
The answer is 30
Step-by-step explanation:
We must touch all the vertexs using the cheapest route
1+2+5+6+4+3+9