document.write( "Question 1160977: Which is the cost of a minimum spanning tree of the weighted graph using Kurskal's Algorithm?\r
\n" ); document.write( "\n" ); document.write( "A. 30\r
\n" ); document.write( "\n" ); document.write( "B. 31\r
\n" ); document.write( "\n" ); document.write( "C. 28\r
\n" ); document.write( "\n" ); document.write( "D. 40\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The question is provided in the link here: https://i.imgur.com/FngP2bs.png
\n" ); document.write( "

Algebra.Com's Answer #784401 by ikleyn(52873)\"\" \"About 
You can put this solution on YOUR website!
.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "There is no a \"Kurskal's Algorithm\".\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "There is the \"Kruskal's Algorithm\", instead.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );