$15\mathrm{.}5-6.$ section $15\mathrm{.}5$ presents a general linear programming formulation for finding an optimal mixed strategy for player $1$ and for player $2.$ using table $6\mathrm{.}13,$ show that the linear programming problem given for player $2$ is the dual of the problem given for player $1.$