Solve this linear programming problem using the simplex method.

MaximizeP = 40x + 8ysubject to these constraints:

 5x + 2y  86 10x + 7y  280 20x + 3y  196 25x + y  200 10x + 3y  140 x  0, y  0 

If u1, u2, u3, u4, and u5 represent the slack variables in the five counstraints (u1 the slack variable in the top constraint listed above, u2 for the second, etc.), then give the values for each of the four slack variables when the optimal solution is reached:

u1 =

u2 =

u3 =

u4 =

u5 =