Given a network with the following distances: Build the model and solve the problem manually, do not use Solver.

From Node	To Node	Distance
1	2	8
1	3	6
2	3	6
2	4	6
3	4	8
3	5	10
3	6	22
4	5	7
5	6	9

(a) Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6.

(b) Determine the minimum distance for the shortest route

(c) If the distance between node 3 to node 4 changes from 8 to 6, does the shortest route change. If yes, what would be the new shortest route nodes and distance?