Kruskal's Algorithm: Student Activity $*$ Use Kruskal's algorithm to find an MST in this graphQuestion $2$

Using Kruskal's algorithm to find an MST $($Minimum Spanning Tree$)$ in the following graph, write the

order of the edges that will be inserted into the MST$.$

$(0,1)$ or $(3,5)$

$(1,4)$ or $(8,7)$

$(6,8)$ or $(7,5)$

$(0,2)$

$(2,3)$