For each graph find the shortest paths.

For each graph find the shortest paths.

4 9. 10 4 (2 (3) (5 13 15 (1 9. 2.

PROBLEM SET 23.3: