(2.a) Give an example of a weighted undirected graph G = (V, E) where its shortest path tree rooted at the source node v1 equals to the minimum spanning tree of G.

(2.b) Give an example of a weighted undirected graph G = (V, E) where its shortest path tree rooted at the source node v1 does not equal to the minimum spanning tree of G.