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 choos between

$\backslash ($ A S $\backslash )$ and $\backslash ($ A E $\backslash ),$ then you would choose $\backslash ($ A E $\backslash )$ first.

Edges themselves are labeled alphabetically: this means that the edge that connects $\backslash ($ S $\backslash )$ to $\backslash ($ A $\backslash )$ is labeled $\backslash ($ A S $\backslash )$ since $\backslash ($ A $\backslash )$ comes before $\backslash ($ S $\backslash )$ in the alphabet.

Here is a list of all the available edges: Edges themselves are labeled alphabetically: this means that the edge that connects $\backslash ($ S $\backslash )$ to $\backslash ($ A $\backslash )$ is labeled $\backslash ($ A S $\backslash )$ since $\backslash ($ A $\backslash )$ comes before $\backslash ($ S $\backslash )$ in the alphabet.

Here is a list of all the available edges:

AS

BS

IS

AI

AE

BI

BC

CD

CI

FI

EF

FG

DG

GH

DH