Problem 6-23 (Algorithmic) Find the shortest route from node 1 to node 7 in the network shown. If the constant is l" it must be entered in the box. If your answer is zero enter "0". For negative values enterminus" sign (-). 7 13 0 10 18 Let 1 if the are from node i to node jis on the shortest route 10 otherwise Min X16+ X23 + 35+ + X46 X2 + X53 ME Flow Out Flow In Node 1 12+ 16 szy STA X32 + + SEX X6 + X52 + X53 + X56 + X57 + X6 + X62 s.t. Flow Out Flow In Node 1 X12 + + ETX X14 Node 2 + ETX X25 X12 + X32 + X52 Node 3 X32 + SEX + ETX Node 4 X46 X14 x52 + + ESX Node 5 + 9x X25+ + SEX X65 X57 Node 6 X65 + X67 + + 9x X56 Node 7 + X57 + X67 xij 20 for all / and Optimal Solution: Variable Value X12 X13 X14 X23 X25 X32