4. Consider the linear optimization problem in standard form minimize 3x] + 4x2 + 6x3 + 7x4 + X5 subject to 2x1 - X2 + X3 + 6x4 - 5x5 - X6 = 6 X1 + x2 + 2x3 + x4 + 2x5 - X7 = 3 XIsX2, X3, X4. X5.X6: 1720 (a) Find the basic solution corresponding to the basis (x3, x7). Check that it is feasible. (b) Solve this linear optimization problem using the simplex algorithm starting from the basic feasible solution corresponding to the basis (x3,*7). (c) Does the simplex algorithm terminate with an optimal feasible solution? If yes, what's the optimal value of the objective function