Let G=(V,E,w) be a connected weighted graph in which each edge eE has weight w(e)>0. Suppose T1 is a Shortest Path Tree (SPT) of G rooted at some source vertex s, and T2 is a Minimum Spanning Tree (MST) of G. Now consider keeping the same set of vertices and edges, but modifying the edge weights to get a modified graph G^=(V,E,w^), where the modified edge weights are defined as w^(e)=(4+w(e))(7+w(e)), for each edge eE. Then, as a set of edges in G^, a. T1 may not be an SPT of G^, and T2 may not be an MST of G^. b. T1 may not be an SPT of G^, but T2 is an MST of G^. c. T1 is an SPT of G^, and T2 is an MST of G^. d. T1 is an SPT of G^, but T2 may not be an MST of G^