Use the revised simplex method to find the optimal solution to the following linear program (LP):

min z = -x1 2x2 s.t. 2x1 + x2 = 5 Sab X1 + x2 = 3 X1, X2 >