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| $\le$ 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