Q2. (10 Points) Consider the following linear programming model for a farmer purchasing fertilizer. And find the feasible solution. Minimum 6X1+3X2: Subject to: 2X/+ 4X, >16; 4X7+3X2 24 X1, X2 > 0 2 Q3 (10 Points Use the simplex method to solve the following linear programming problem. After each pivot operation, list the basic feasible solution. Your final answer should be f(max) and the X1, X2, and X3 values for which fassumes its maximum value. Maximize f = 2X; + X: + 3X; subject to X: + 2X2 + X: 0 04. (10 Points) Telephone calls from New York to Los Angeles are transported as follows: The call is sent first to either Chicago or Memphis, then routed through either Denver or Dallas, and finally sent to Los Angeles. The number of phone lines joining each pair of cities is shown in the following table. Cities N.Y.-Chicago N.Y.-Memphis Chicago-Denver Chicago-Dallas Memphis-Denver Memphis-Dallas Denver-L.A. Dallas-L.A. No. of Telephone Lines 500 400 300 250 200 150 400 350 Use the maximum flow method to determine the maximum number of calls that can be sent from New York to Los Angeles at any given time