For each of the following graphs, generate two minimum spanning trees, one using Kruskal’s algorithm and one using Prim’s algorithm starting at node A. List the edges of these trees in the order in...

For each of the following graphs, generate two minimum spanning trees, one using Kruskal’s
algorithm and one using Prim’s algorithm starting at node A. List the edges of these trees in the
order in which they were selected. If at any point there are multiple edges that may be added on
the next step, use an asterisk to indicate that you made a choice. For example, one solution for
this graph