Optional extra credit question: Non-distinct edge weights * In class, we proved that both Kruskal's algorithm and Prim's algorithm correctly find the unique minimum spanning tree when the edge weights are distinct. Pick one of these algorithms and prove that it still correctly finds a minimum spanning tree even when the edge weights are not all distinct