Question: Consider the weighted graph G1 below and answer the questions that follow: 22 118 0 6 @ 13_ Figure 1: Graph G1 (a) Give the
Consider the weighted graph G1 below and answer the questions that follow:

22 118 0 6 @ 13_ Figure 1: Graph G1 (a) Give the weight of the minimum spanning tree of G. (a)_ (b) Give the edges in the minimum spanning tree of G1 (Edges may be specified by a pair of vertices, e.g., (A, B)) (b) (c) What is the sequence of edges picked by the Prim's algorithm when executed on the above graph G1 with starting vertex A? (c) (d) What is the sequence of edges picked by the Kruskal's algorithm when executed on the above graph G? (d)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
