2 14 3. A 7 8. 6 3 4 te 2)

#4 help me out!

Extracted text: 2 14 3. A 7 8. 6 3 4 te 2)


Extracted text: Use the provided graph to answer the questions. The numbers on the graph give the "weight" of each edge. (a) Suppose you use Kruskal's method for finding the minimum spanning tree for the graph. What is the weight of the 7th edge that is added? (b) How many vertices does the provided graph have? (c) How many edges would a spanning tree for the provided graph have? (d) Suppose Prim's method is used to find the minimum spanning tree for the graph. Vertex A is the beginning vertex. What is the weight of the 6th edge that is added?