Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of the maximum possible weight a MST of G can have. Then the value of x will be_____
the answer to this question is given as 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure