Use Bellman-Ford to determine the shortest paths from vertex s to all other vertices in this graph. Afterwards, indicate to which vertices s has a well defined shortest path, and which do not by indicating the distance as-00. Draw the resulting shortest path tree containing the vertices with well defined shortest paths. For consistency, you should relax the edges in the following order: sa, sb, ac, ba, bd, cb, cd, ce, df, ed and fe. S 5 -2 -1 3 -5 10 114 b d f -10 -6 6