For the graph below, using Kruskal's algorithm, list the edges in the order in which they are added to the MST$.$ Remember that in the event of a tie between the cost of the edges, we will choose the node based on alphabetical order. Note that this is an undirected graph, so the edge $A-B$ also represents the edge $B-A$

Edge list:

$5$: $[$Select$]$

$6$; $[$Select$]$