2. Using the below unweighted graph, construct a weight function w on the edges, using positive weights only, using the following conditions:

- the minimum spanning tree is distinct from any of the seven simple source shortest path trees

- the order in which Prim's algorithm adds the safe edges is different from the order in which Kruskal's algorithm adds them

- Boruvka's algorithm takes at least two rounds to construct the minimum spanning tree

e g