Consider the following shortest-route problem involving six cities with the distances given. Path Dista

[answerhappygod]

Consider the following shortest-route problem involving six
cities with the distances given.
Path
Distance
1 to 2
3
1 to 3
2
2 to 4, 4 to 2 4
2 to 5, 5 to 2 5
3 to 4, 4 to 3 3
3 to 5, 3 to 5 7
4 to 6
6
5 to 6
2
1. Draw the network for this problem
2. Formulate the LP for finding the shortest distance
from City 1 to City 6.