Correct option is (d) maximum weight
Best explanation: A maximum spanning tree can be computed by negating the weights for each edge and applying Kruskal’s algorithm. Thus, it is a spanning tree of a weighted graph having maximum weight assigned to all the edges.