Use the simplex technique to find the x's which yield the maximum of P, P=2x + 3x + 2 + x3 where x, x2, and x3 are required to be non-negative and to satisfy the constraints that follow: x1 + x2 + 2x3 200 3x1 + 2x2 + x3 500 x1 + 2x2 + 2x3 300