Try Another Version of This Question

[Graphs generated by this script: setBorder(60,30,60,30);initPicture(-10,10,-10,10); fontsize=14;fontstyle='none';marker=null;line([0,0],[10,0]);line([0,0],[-5,8.6602540378444]);line([0,0],[-5,-8.6602540378444]);line([10,0],[-5,8.6602540378444]);line([10,0],[-5,-8.6602540378444]);line([-5,8.6602540378444],[-5,-8.6602540378444]);fontbackground='white';fontfill='blue';text([0,0],'A','belowleft');dot([0,0]);fontfill='red';text([5,0],'4');fontfill='red';text([-2.5,4.3301270189222],'8');fontfill='red';text([-2.5,-4.3301270189222],'10');fontfill='blue';text([10,0],'B','belowright');dot([10,0]);fontfill='red';text([2.5,4.3301270189222],'3');fontfill='red';text([2.5,-4.3301270189222],'12');fontfill='blue';text([-5,8.6602540378444],'C','aboveleft');dot([-5,8.6602540378444]);fontfill='red';text([-5,1.7763568394003E-15],'5');fontfill='blue';text([-5,-8.6602540378444],'D','belowleft');dot([-5,-8.6602540378444]);]

Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Which of the edges below are included in the minimum cost tree?

Get help: