1. (50 points) Consider the following LP. MaximizeSubjectto3x1+4x22x1+3x253x1+2x27x1,x20 Draw the feasible region of the LP (and lightly shade inside the feasible region). Identify its extreme points (corner points) on your drawing, and also determine the corresponding values for x1 and x2 at these points. Provide the objective value at each of the extreme points. Based on this, how many optimal solutions are there? What are they? What is the LP's optimal objective value? What are the binding constraints? Write the formulation in the standard form. What are the Basic Solutions and Basic Feasible Solutions in the standard space? Check your answer with Gurobi and submit your code