The length of the path from v5 to v6 in the MST of previous question with n = 10 is (A) 11 (B) 25 (C) 31 (D) 41

Question

An undirected graph G(V,E) contains n ( n > 2 ) nodes named v₁ , v₂ ,....v_n . Two nodes v_i , v_j are connected if and only if 0 <|i - j| ≤ 2 Each edge (v_i , v_j ) is assigned a weight i + j. A sample graph with n = 4 is shown below.

The length of the path from v₅ to v₆ in the MST of previous question with n = 10 is 

(A) 11 

(B) 25 

(C) 31

(D) 41

Answer 1

Correct option is (C) 31

12 + 8 + 4 + 3 + 6 + 10 = 31