Consider the following Linear Program (LP):

MAX Z= 5x1 + 6x2 - 2x3

subject to:

5x1 - 3x2 + 3x3 15 (Constraint- A)

-2x, + 4x2 - 6x3 9 (Constraint-B)

2x1 + 2X2 +4; 16

(Constraint- C

X1>0, x2> 0, *3> 0

Use the Tabular Form of SIMPLEX method to obtain the Optimal Solution for the above LP.

Clearly report your Optimal Solution and the value of its Objective Function (Z).

NOTE: Show complete working for all iterations