Refer to "Problem D" in the packet for the following questions.The West-to-East highway system is shown on the chart appended to the end of this assignment.(Or, the system starts at Node 1 and ends at Node 6) The numbers on the chart are capacity flows.The problem is to find maximal flow of cars from Node 1 to Node 6.

(i)The circles are nodes.The numbers inside the circles are the node identity.

(ii)The arcs are the lines connecting two nodes.The arcs are streets.The numbers on the arcs are how many cars can move from node-to-node during a given time period.Some streets (nodes) are one-way streets, and some are two-way streets.

(iii)Note that (i) the problem is written out below and (ii) each constraint of this problem is labeled.Also note that constraints 7 - 11 have multiple constraints with them, but each of those is considered a single constraint (for example, Constraint 7 has three constraints.)Note also that some of the constraints below are not correct.

(1) Problem B, Question 1 of 2:Consider Constraints 1 to 6.Which of these constraints is not correct?(In the answer blank, you can answer "Constraint X", "constraint X", simply "X", where "X" is the constraint number you wish to answer).(5 points).

PROBLEM D: Maximum Flow problem setup: Max xai subject to constraints Constraint 1: x12 + X13 + X14- X61 Constraint 2: X14 + X25 - X11 - X41 Constraint 3: X4 + X36 - X1 - X4: Constraint 4: x4: + x4+ X45 + X46 - X14 - X14 - X34 -X54 Constraint 5: X54 - XH - X15 - X45 Constraint 6: X61 - X46 - X56 Constraint 7: x1: $ 2; X13 56; X14 $3 Constraint 8: xMS1; X15 54 Constraint 9: xu$4; Constraint 10: x4: $1; xo $3; x46 53 Constraint 11: xs $1; X56 56 Constraint 12: x61 $ 1,000 Constraint 12:x1 2 0 for all i, j Maximum Flow map: 3 Exit City Enter City 2