Q2. Find the minimum spanning tree of the graph below by choosing node C as a source using Prim's algorithm. A 3 D 2 3 B E 3 2 F

Draw a minimum spanning tree for the following graph: 2 A В 3 G 7. F 4 H. 2 8 E 1 Draw a binary search tree using the following values in the order given: 12, 17, 4, 11, 19, 15, 6 LO to

Q2. Find the minimum spanning tree of the graph below by choosing node C as a source using Prim's algorithm. A 3 D 2 3 B E 5 3 2 F

Use Prim's Algorithm starting at vertex SS to construct a minimum spanning tree of the graph below. If we tie-break alphabetically, what is the order of edges we construct our spanning tree?   a. {S,T}, {S,V}, {V,Z}, {W,Z}, {Y,Z}, {W,X}, {U,Y} b. {S,T}, {S,W}, {W,Z}, {V,Z}, {Y,Z}, {W,X}, {U,Y} c. {S,T}, {V,Z}, {W,Z}, {Y,Z}, {S,V}, {W,X}, {U,Y} d. {S,T}, {S,V}, {S,W}, {V,Z}, {W,X}, {Y,Z}, {U,Y}

Find the Minimum spanning tree of the below graph using Kruskals algorithm. You may refer to the class slides for algorithm. Clearly trace the working of the algorithm in your worksheet and upload the same as the solution.