5. (10 points) Consider the following LP. max s.t. z = X1 + 3x2 + x3 21 + x2 + x3 + 14 2.x1 + x2 - 13 -22 +23 -16 21, 22, 23, 24, 25, 26 - 15 = 40 = 10 = 10 >0 Someone told us that c = 10, 22 = 0, X3 = 10, 24 = 20, Is = 0, 16 = 0) is a feasible solution. Check if the given point is actually a feasible point. Start from the given point and use the Simplex algorithm to find the optimum