Consider the following problem: Max 2x1 - X2 + X3 s.th 3x1 + X + x; = 0, X2>=0, x>=0 Construct the complete first simplex

Consider the following problem:
Max 2x1 - X2 + X3
s.th
3x1 + X› + x; <= 90
X1 - X2 + 2X3 <= 15
-X1-X ＋X >ニ 530
and xi>= 0, X2>=0, x>=0

Construct the complete first simplex tableau (Iteration 0) for the simplex method.
Work through the simplex method step by step to solve the problem. Clearly state the optimal solution and objective function value.