6 For a two-person zero-sum game with an m n reward matrix, let x  (x1, x2, . . . , xm) be a solution to the row player’s LP and y  ( y1, y2, . . . , yn) be a solution to the column player’s LP. Show that if the row player departs from his optimal strategy, he cannot increase his expected reward against y.