Q. 4 Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in
the matrix W below is the weight of the edge {i, j}.
What is the minimum possible weight of a path P from vertex 1 to vertex 2 in
this graph such that P contains at most 3 edges ?
(A) 7
(B) 8
(C) 9
(D) 10
Answer: (D)
Explanation:
