3.

(a) Solve the following network problem for shortest route between the origin and destination. The numbers on the arrows connecting different pairs of nodes represent distance in kms. Use dynamic programming.

(b) Reconsider the network given in (a). If the road between nodes 6 and 9 is blown up and is therefore not available, how will the shortest route change, if at all?

Transcribed Image Text:

Origin 3. 4 7 6 12 5 11 7 8 10 3 8 3 9 10 7 6 11 Destination 10