Please help with this question .3

Consider the following transshipment network for finding the shortest route from node 1 to node 7. (a) Formulate a linear programming model of the problem. (Express your answers using xij where each xij is either 0 or 1 for the are from node i to node j.) Min screenshot 1 s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7 Flows Consider the following transshipment network for finding the shortest route from node 1 to node 7. node 1. The second column contains nodes 2, 3, and 4. The third column contains nodes 5 and 6 . The right-most column contains node 7. Arrows are shown between various locations. The following list contains the numbers placed on the graph. - 12:7 - 23:3 - 32:3,46:3 - 52:5 - 65: 2 - 7: no departing arrows - 13:9 - 25:535:4 - 53:47:3 - 14:18 - 56:2 - 57:6 (a) Formulate a linear programming model of the problem. (Express your answers using xij, where each xij is either 0 or 1 for the are from node i to node j.) Min Screenshot 2 s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7 Flows (a) Formulate a linear programming model of the problem. (Express your answers using xij where each xij is either 0 or 1 for the are from node i to node j.) Min s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows screenshot 3 Node 5 Flows Node 6 Flows Node 7 Flows For all xij=0,1. (b) Find the shortest route from node 1 to node 7 in the network shown. (Enter your answers as a comma-separated list.) path=1,7