Consider the following weighted graph: A 16' -21 13 20 12 F B -14 00 15. .11. 17 9 9 18 19 5 10. G E 1. Apply Prim's algorithm to construct a minimal spanning tree for the given weighted graph. Start at E and list the vertices in the order they are chosen. What is the weight of the spanning tree after using Prim's algorithm? 2. Apply Kruskal's algorithm. This time list the edges and their weights in the order the edges are added. Note that the weights in the graph consist of the numbers 4-21 inclusive. What is the weight of the spanning tree after using Kruskal's algorithm?