For each graph find the shortest paths.

For each graph find the shortest paths.

(1) 10 (2) 8 3 5. 6 2.

PROBLEM SET 23.3: