Kruskal's algorithm on the graph. Show step-by-step.

1. [6 pts] Show the execution of Kruskal's algorithm on the following graph step-by-step. When there are two or more than two edges that have the same weight, always consider them in alphabetical order of the vertices, i.e, if edge (A, B) and (B, E) have the same weight, we will pick edge (A, B). (see Fig.23.4 on textbook pp.632 as one example) 15 0 5