Question 3 (3 points) Referring to Table the constraint associated with the node 1 for the 0-1 integer linear programming formulation of the shortest route problem is 1) X12 + X13 + X14 = 1 2) 21/12 - 17X13 + 30X14 = 1 3) 2101 - 17x13 - 30|14 = 0 4) - XBX140 Table 1 Given the following network with the indicated distances between nodes (in miles). Assume that the amount on each branch is the distance in miles between the respective nodes. Also assume that it is not possible to travel from a node with a higher number to a node with a lower number. 25 21 10 18 30 17 12 10 15 25