solve please

PART I Here is an integer linear optimization model: X1, X2 in INTEGER maximize 2X1 + X2 X1+ X2 $ 5 X1 - X2 $ 3 X12 -1 X2 s 2 There are no non-negativity constraints. Graph the feasible region and objective function at the optimal solution. Hint: Be able to do this without electronics. Question 1 0.1 pts There are ____ feasible decision points. (One feasible decision point is a value for decision X1 and a value for X2.) Question 2 0.1 pts The optimal value for decision X1 is Question 3 0.1 pts The optimal value for decision X2 is Question 4 0.1 pts The optimal objective value is