Kibdly address all in blanks

Consider the following graphical LP model where the objective function is to maximize X2. a) Fill in the blanks using the numbers 1, 2, 3, and 4 for the correct constraints. For incorrect constraints, write NA. X1 60 2 10X1 $ 60 NA X1 - X2 20 NA X2 2X2 s 80 4 70 2 6X1 + 4X2 2 0 D NA 60 4X1 + 4X2 2 16 3 C 50 NA G H X1 - X2 50 40 30 10X1 + 10X2 2 50 1 NA 20 10X2 s 40 10 NA X1 + X2 2 50 10 20 30 40 50 60 70 X1 3 5X1 + 5X2 s 50 NA 60X1 + 40X2 s 0 NA b) Fill in the blank using the correct feasible region (A, B, C, D, E, F, G, H, or 1). B c) Is Constraint 2 in the graph binding or non-binding? O