Use Kruskal's algorithm to find the minimum spanning tree from the following graph. First, write a list of edges in order of smallest to largest weight. Then draw the minimum spanning tree using the sorted list of edges. You may draw on a computer or by hand, but show the order of adding edges.

5-D E 2 3 5 B 3-4 3 5 A C