$($b$)(2$ points$)$ Suppose we run the Kruskal's algorithm on this graph. List the edges appearing in the Minimum Spanning Tree $($MST$)$ in the order they are added to the MST$.$ If you prefer, you are allowed to index edges by their weight. $($e$.$g$.$ Instead of DF$,$ GH$,...,$ you can write $1,2,$dots, $)$