Maximum weighted spanning tree

Question

Let G be a simple undirected complete and weighted graph with vertex set V={0,1,2..99}.Weight of edge (u,v) is |u-v| where 0<=u,v<=99 and u not equal to v.Weight of the corresponding maximum weighted spanning tree is (a)4950(b)4451(c)7350(d)7351

Answer 1

Apply kruskal for max weight to find the spanning tree.

v99 is connected to vertices v0 to v49 and  weights are  99+98+97+....+ 50 = 3725

and v0 is connected to v50 to v99 and  weights are  (we will not include 99 again as we have already added) 98+97+....+ 50 = 3626

So finally Weight of the corresponding maximum weighted spanning tree is = 3725 + 3626= 7351