Use Graphical Method as discussed in class to solve two-variable linear programming (LP) problems. 1) Solve the following LP problem Maximize Z(X1, X2) = 3x2 + 2x2 Subject to 2x1 + x2 S12 - X:+ xy S3 X1 2 0,X2 20 1.1) Draw the graph corresponding to the given constraint inequalities and non-negative conditions based on the above LP model. 1.2) On your graph, clearly identify the region of feasible solutions (feasible region) of this LP model. 1.3) On your graph, use a dashed line to demonstrate how the optimal solution of this problem is to be found. 1.4) Identify from your graph or calculate the value of the optimal solution (x1,x2). 1.5) Calculate the corresponding optimal objective function value 2(x; x;). 2) Solve the following LP problem. Note that in this LP problem, the constraint functions are the same as in 1) above and the objective function Z is different. Maximize Z(X,X2) = 4x2 + 2x2 Subject to 2x1 + x2 = 12 - x + x2 53 X1 20,X220 2.1) On the solution graph, use a dashed line to demonstrate how the optimal solution is to be found. 2.2) Identify or calculate the value of one or more optimal solutions (xi x3) at the corner(s) of the feasible region. 2.3) Calculate the corresponding optimal objective function value (xi, x3). 2.4) If you have found more than one corner optimal solution of this LP problem, indicate how many optimal solutions it has and indicate where these optimal solutions can be found