It's B, I think.

The Gateway to Computer Science Excellence

+1 vote

An undirected graph G (V, E) contains n (n > 2) nodes named v_{1} , v_{2} ,...,v_{n}. Two nodes v_{i} and v_{j} are connected if and only if 0 < │ i − j│ ≤2. Each edge (v_{i} , v_{j} ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:

A) 88 B)91 C)49 D)21

52,218 questions

59,891 answers

201,086 comments

118,128 users