4. Given the following graph, show the minimum spanning tree resulting from using Prim's algorithm. Show the order that the edges are added to the tree and the list of edges in the resulting tree. For example, if the tree contained edges from A to C then C to E in that order, specify it as {AC,CE}. Specify the vertices in alphabetical order for each edge. For example, instead of "C-B" it should be "B-C". Start at node A. [4pts)