0/1 point 11. Given a weighted, undirected graph we can convert it to a directed graph by replacing each undirected edge (u, v) with a pair of oppositely directed edges (u, v) and (v, u) of the same weight. With this understanding, we can see how Dijkstra's algorithm works on a weighted, undirected graph. Let G be such a graph with all distinct edge weights. Let T be a minimum spanning tree in G. Let S be the shortest path tree produced by Dijkstra's algorithm with some source vertex v. Identify the strongest relationship that is true between T and S. OTES O w(T) = w(S) O w(T) > W(S) O w(T)