Consider the following transshipment network for finding the shortest route from node 1 to node 7. 18 (=) Formulate a linear programming model of the problem. (Express your answers using x , where each x is either 0 or 1 for the arc from node / to node j.) Min s.t. Node 1 Flows X12 + X3+*4=1 Node 2 Flows -X12 + X23 + Xos = 0 Node 3 Flows -X13 - *23 + *32 + *35 - X53 = 0 Node 4 Flows -X14+ X46=0 Node 5 Flows -X25 - X35 + X52 + X53 + X56 + X57=0 Node 6 Flows -X46 -X56 + *65 + X87= 0 Node 7 Flows -*57 - $67= 0 X For all x, = 0, 1. (b) Find the shortest route from node 1 to node 7 in the network shown. (Enter your answers as a comme-separated list.) path = 1, 2,5,6 Need Help? Read It