Answer Happy

Assume we have a weighted connected undirected graph. If we use Kruskal's MST algorithm but sort and process edges in non- increasing order by weight, it will return the spanning tree of maximum total cost (instead of returning the spanning tree of minimum total cost). True False