2. [25 points] Given a LP problem as follows, Max X1 + 3x2 s.t. x1 + x2 > 5 X1 2x2 = 2 X1, X220 a) [3 points] Transform it to standard form. b) [5 points] Reformulate this program with only equality constraints by introducing artificial variable(s). c) [10 points] Solve this problem by big M method. d) [7 points] Use the final tableau to tell the followings. Is this problem feasible or not? If it is feasible, is the problem unbounded or not? If it is unbounded, find an unbounded direction in the sense of original variables (X1, X2). If it is bounded, is the optimal solution degenerate, and does it have multiple optima