Assume we are running Prim's algorithm to find a Minimum Spanning Tree (MST) on the following graph. The vertices are la

[answerhappygod]

Assume We Are Running Prim S Algorithm To Find A Minimum Spanning Tree Mst On The Following Graph The Vertices Are La 1 (155.91 KiB) Viewed 26 times

Assume we are running Prim's algorithm to find a Minimum Spanning Tree (MST) on the following graph. The vertices are labeled by A,B,C,D,E,F,G,H,I,J. The edge weights are given next to the edges. 6 5 A B 3 4 G H 2 10 If the Prim's algorithm starts with vertex B, the correct order of the vertices that Prim's adds to the minimum spanning tree (INCLUDING B) is The weight of the output tree is Note: Answer 1 should be a sequence of capital letters with no spaces before, after, and between, for example, BACDEFGHIJ. Answer 2 should be an integer with no spaces before and after. 4 D 5 2 3 10 E 4 8 7 LO 5 3 F