Problems 1. Formulate the dual of the following linear programming model: MinZ=x1+2x2+x3subjectto:2x13x2+x3=62x13x2x315x1+7x318x1,x20x3unrestricted 2. An electronic company manufactures 2Hp and 1Hp electric motors. The company has resource constraints for production time, steel and wire. A Linear Programming model of the manufacturing process is formulated as follows: Decision variables: X1 is number of 2Hp motors produced and X2 is number of 1Hp motors produced. The Simplex method was used to solve this problem with the following optimal (final) tableau: a. Interpret the CjZj values (shadow prices) for this tableau. b. Define the dual variables. c. Determine the ranges for each of the three resources (production time, steel and wire) for which the basis will remain feasible. d. Determine the range of values of profit per unit of 2Hp motors for which the basis remains unchanged