4.4. Solve the following linear program using the simplex method. Explain each simplex pivot by showing a complete basis representation or simplex tableau for each extreme point visited. Compute the value of the objective function and decision variables at op- timality, and indicate which statement best describes the solution and why: Maximize Z = 4x1 + 6x2 Subject to: X1 + X2 2 -4 3x 2x2 = 6 x1 + x2 25 X1 + x2 = 10 X1, X2 2 0 (a) this linear program has a unique optimal solution (b) this linear program has alternate optima (c) this linear program is infeasible (d) this linear program is unbounded