2. You are provided with the following integer program: max z = x + 2y s.t. 5+2 3 y 0 and integer (a) On the following page, use the graphical solution method to identify the feasible points. Use the scale 1 by 1 for each small square in the graph. (b) Find the extreme points of the LP relaxation's feasible region. Extreme point 1: Extreme point 2: Extreme point 3: Extreme point 4: (e) Find the extreme points of the convex hull and calculate their objective values. (d) Draw an isoprofit line that passes through the point (x = 4, y = 0) and find the direction of optimization. (e) Provide the optimal solution and optimal objective function value. Optimal solution: c Optimal objective value