Consider the following linear program: max z-2x1-x2 + x3 s.t. x1+x2+x3 =0 Row 0 of the LP's optimal tableau is as follows (you do not need the rest of the Simplex table to answer the question). z x1 x2 x3 s1 e2 a2 a3 RHS 1 (M-1) (M+2) 0 rowo 1 4 0 0 0 Which of the following is True? Since e2 is nonbasic, e2-0, thus constraint 2 is binding Since e2 is nonbasic, e2 is NOT 0, thus constraint 2 is NOT binding