This graph is copied again for your convenience. 1 A 3 1 E 4 S 2 2 I 50 5 2 F 7 H 9 G 6 2 4 8 B C D For the graph above, what is the order in which edges are added to the MST when running Kruskal's Algorithm. Your answer should be in the form of a comma separated list with spaces. In the case of a tie, choose the edge which comes first in alphabetical order i.e. if you had to choose between AS and AE, then you would choose AE first. Edges themselves are labeled alphabetically: this means that the edge that connects S to A is labeled AS since A comes before S in the alphabet. Here is a list of all the available edges: AS BS IS ΑΙ AE BI BC CD CI FI EF FG DG GH DH AS, AE, AB, AI, CI, CH, DG, FH e). Given any graph with V vertices and Ę edges, how many edges will the graph's MST have? Write your answer in terms of V and E with no spaces. V-1

This graph is copied again for your convenience. 1 A 3 1 E 4 S 2 2 I 50 5 2 F 7 H 9 G 6 2 4 8 B C D For the graph above, what is the order in which edges are added to the MST when running Kruskal's Algorithm. Your answer should be in the form of a comma separated list with spaces. In the case of a tie, choose the edge which comes first in alphabetical order i.e. if you had to choose between AS and AE, then you would choose AE first. Edges themselves are labeled alphabetically: this means that the edge that connects S to A is labeled AS since A comes before S in the alphabet. Here is a list of all the available edges: AS BS IS ΑΙ AE BI BC CD CI FI EF FG DG GH DH AS, AE, AB, AI, CI, CH, DG, FH e). Given any graph with V vertices and Ę edges, how many edges will the graph's MST have? Write your answer in terms of V and E with no spaces. V-1