We use Dijkstra's algorithm to find the shortest paths from vertex s for the problem (G = (V, E), d, s) where d contains positive values. We then double every edge distance i.e. d'(u, v) = 2 *d(u, v). How does the solution for (G (V, E), d, s) relate to the solution for the problem (G = (V, E), d', s)? Explain briefly and justify your answer.