Please explain the steps too!

Question 3 ( 2.5 points): Consider the following linear programming problem: Minimize X2Y Subject to (1) 2X2Y4 (2) X+Y4 (3) 2X5 (4) Y4 X,Y0 (1) (0.5 point) Clearly show the feasible region and gradient on the graph. (2) (0.5 point) Clearly show gradient on the graph. (3) (0.5 point) Use the graphical solution technique to determine the point for optimal solution. Clearly show the optimal point on the graph and list simultaneous equation to get optimal solution. What is the value of the objective function at optimum? (Show your calculations). (4) (0.5 point) Explain in one sentence how the gradient of the objective function changes of the coefficient of x2 decreases. (5) (0.5 point) If the second constrain is changed to x+2Y5, how many optimal solution(s)? (Show on your graph for (1) and (2))