American history homework help. A 6-node network with the following list of distances between various pairs of nodes:
| From Node |
To Node |
Distance |
| 1 | 2 | 150 |
| 1 | 3 | 200 |
| 2 | 3 | 100 |
| 2 | 4 | 200 |
| 2 | 5 | 50 |
| 3 | 4 | 350 |
| 3 | 5 | 300 |
| 4 | 6 | 100 |
| 5 | 6 | 100 |
10a (10 points) Formulate finding the shortest route from node 1 to node 6 as a linear programming problem.
10b (10 points) Solve the problem on a linear programming software and show the total distance and the connections from node 1 to node 6 for the shortest route.