Problem 6-23 (Algorithmic) Find the shortest route from node 1to node 7 in the network shown. If the constant is "1" it must beentered in the box. If your answer is zero enter "0". For negativevalues enter "minus" sign (-). Min x12 + x13 + x14 + x23 + x25 +x32 + x35 + x46 + x52 + x53 + x56 + x57 + x65 + x67 s.t. Flow OutFlow In Node 1 x12 + x13 + x14 = Node 2 x23 + x25 + x12 + x32 + x52= Node 3 x32 + x35 + x13 + x23 + x53 = Node 4 x46 + x14 = Node 5x52 + x53 + x56 + x57 + x25 + x35 + x65 = Node 6 x65 + x67 + x46 +x56 = Node 7 + x57 + x67 = xij ? 0 for all i and j OptimalSolution: Variable Value x12 x13 x14 x23 x25 x32 x35 x46 x52 x53x56 x57 x65 x67 Shortest Route: Length =
