Given a network with the following distances: Build the model and solve the problem manually, do not use Solver. Your paperwork must show the network. All the arcs go in one direction only From To Node 1 1 2 2 3 3 3 4 5 Node Distance 2 3 3 4 4 5 6 5 6 8 6 6 6 8 10 22 7 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? Enter your answer using this format: a. Connect nodes 1-1-1 b. distance = ? c. yes/no, new connected nodes and distance = ?