Refer to the graph below and show the steps of Kruskal's Algorithm on the graph. For example, if the first edge added by the algorithm connects nodes X and Y and the second edge added connects X and Z, the correct answer would begin: XY,XZ, In the event of a tie, select the edge with the endpoint that would appear first in alphabetical ordering. E.g. if an edge AD and BC both are valid choices for the algorithm, choose AD since A would be first out of A,B,C, and D in alphabetical order. AB,BC,CD,DE,EF,FG,GH,HI,IJ HI,BC,CD,AB,IJ,GH,FG,CF,EF AB,BC,CD,AE,EF,FG,GH,HI,IJ HI,BC,CD,AB,I,GH,FG,EF,CF