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 (a) this linear program has a unique optimal solution Subject to: x1 + x2 > -4 3x1 2x2 5 6 x1 + x2 > 5 x1 + x2