Construct the shortest path tree by Dijkstra's algorithm on the same graph, where A is the starting node. 3 10 F 2 8715 18 B . D 10 25 E Note: All the letters in the answers have to be uppercase. Dijkstra's algorithm for the shortest path tree T Shortest path length dy from source node s to v Pv Node in T to which Node v is connected Node Sequence # dv pv A 0 (starting) 0 N/A B D E F Tree Cost (total edge weights)