14) Execute Kruskals algorithm on the graph below and list the edges in the order they are added to the minimal spanning tree. The nunbers are the edge weights. since the edge weights are unique, you can identify the edges by using their weights (ie, writing 1 2 3 means adding edges AB CE BD) 15) Execute Prims algorithm on the graph above and list the edges and nodes in the order they are added to the minimal spanning tree. Begin with node A: Edges/Nodes