Question: 1. If an edge-weighted graph has several edges of the same weight, there will be more than one way to order the edges while still having them in increasing order of weight. What difference do these orderings make to Kruskal's algorithm?
2. Prim's algorithm does not specify an edge of G with which to start. What would happen if you ran Prim's algorithm twice, but starting with different edges?