2. Consider the following graph G with solid and dotted edges:
The solid edges form a spanning tree T of graph G. Each of the solid edges has a weight. Assign weights to the dotted edges, (1,2), (3,8), (6,10), (7,11), (8,12), and (9,10), such that:
• Each of the edge weights is a positive INTEGER;
• Tree T is a MINIMUM spanning tree of G and NO other tree is a MINIMUM spanning tree of G;
• Each of the edge weights of the dotted edges is as small as possible.
For instance, if you assign the edge weight 1 to edge (1,2), then replacing edge (1,5) in T with edge (1,2) will give a spanning tree with less weight than T. Thus edge (3,8) must have a weight greater than 1. If you assign the edge weight 4 to edge (1,2), then replacing edge (1,5) in T with edge (1,2) will give a different spanning tree with weight equal to T. This new tree would also be a minimum spanning tree. Thus edge (1,2) must have a weight greater than 4.