3. (10 Points) Run DAG-SHORTEST-PATHS on the directed graph of Figure 24.5 (Text book], using vertex r as the source. S 2 N OO DO 3 b) 5 2 2 3 c) 1 -2 AN -2 N 6 5 3 2 2 e) 5 - 2 2 6 3 2 (9) Figure 24.5 The execution of the algorithm for shortest paths in a directed acyclic graph. The vertices are topologically sorted from left to right. The source vertex is s. The d values appear within the vertices, and shaded edges indicate the a values. (a) The situation before the first iteration of the for loop of lines 35. (b)-g) The situation after each iteration of the for loop of lines 35. The newly blackened vertex in each iteration was used as u in that iteration. The values shown in part (g) are the final values