Given the strongly connected directed graph, use Dijkstra's algorithm to find the shortest paths from the specified source vertex to each and every other vertex. Break ties alphabetically. In each case, label the edges a, b, c, d, e, and f in the order of the addition of the edges to the SPT. Determine also the weights of the shortest paths to each vertex. ap beloelib s no 9 S 1 2 1 a. Source vertex is S; 2 5 3 T 6 4 8 B 2 7 3 7 6 A D 2 4 8 5