Graph Algorithms

Let G be a weighted graph with edge weights greater than one and G′ be the graph constructed by squaring the weights of edges in G. Let T and T′ be the minimum spanning trees of G and G′, respectively, with total weights t and t′. Which of the following statements is TRUE?

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra's shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex $v$ is updated only when a strictly shorter path to $v$ is discovered.