Consider variation 3 of the political campaign problem (see table 15.6). refer to the resulting linear programming model for player 1 given near the end of sec. 15.5. ignoring the objective function variable x3, plot the feasible region for x1 and x2 graphically (as described in sec. 3.1). (hint: this feasible region consists of a single line segment.) next, write an algebraic expression for the maximizing value of x3 for any point in this feasible region. finally, use this expression to demonstrate that the optimal solution must, in fact, be the one given in sec. 15.5.