Consider a graph \(G = (V, E)\), where \( V = \{ v_1,v_2,…,v_{100} \}\), \(E =…

Consider a graph $G = (V, E)$, where $V = \{ v_1,v_2,…,v_{100} \}$, $E = \{ (v_i, v_j) ∣ 1≤ i < j ≤ 100 \}$ and weight of the edge $(v_i, v_j)$  is $∣i–j∣$. The weight of minimum spanning tree of $G$ is ________.