notes in the case where the weight of is less than the weight of we can conclude that is not minimum spanning treeand the assumption that there exist edges , with (ew(fis incorrect and therefore is minimum spanning tree (equal to or with different edge setbut with same weightfigure step by step representation of kruskal' algorithm ( ( ( ( ( extractmin ( )--accepted {{ }mst {( )( )( ( ) {( )( )} ( extractmin ( )-accepted {( }{ }mst {( )( )( ) {( )( )( ( )( extractmin ( )--rejected {{ }{ }mst {( )( )( ) {( )( )( ( extractmin (qaccepted {( )( )( ){ )mst {( ) {( )( )( )( )( )( ( extractmin ( )-accepted {( ){ }{ }mst {( )( ) {( )( )( )( ( {{ )( ){ }( )mst { {{ )( )( ){ ){ ){ ){ ( ( the algorithm continues until becomes emptybut since the forest has become one treeall remaining edges in will be rejected and no change will happen to mst lovely professional university