7. (5 Points) Use the Dijkstra's algorithm to find the Shortest Path Tree (SPT) from vertex 0 for the following edge-weighted digraph, 1) provide the edges on the SPT in the order as they are added to the SPT, 2) provide the shortest distance from vertex 0 to every vertex reachable from vertex 0 in the following table 01234 5 67 89 10 distro! 49 95 62 63 39 3 4 48 24 58 94 15 10 18 20 34