Refer to the last paragraph of Sec. 15.5. Suppose that 3 were added to all the entries of Table 15.6 to ensure that the corresponding linear programming models for both players have feasible solutions with x3 ≥ 0 and y4 ≥ 0. Write out these two models. Based on the information given in Sec. 15.5, what are the optimal solutions for these two models? What is the relationship between x*3 and y*4? What is the relationship between the value of the original game v and the values of x*3 and y*4?