Given a linear program as follows, Max Z = x1 + x2 s.t. 2x1 + x2 = 3, X1 + 2x2 0, a. In order to have a workable initial Simplex tableau, reformulate this program's standard/equation form by introducing artificial variable(s) and big M (write out just the formulation). b. Use big-M method to tell if this problem is infeasible by showing the first 2 or 3 tableaus