Helen and David are playing a game by putting chips in two piles (each player has two piles P1 and P2), respectively. Helen has 6 chips and David has 4 chips. Each player places all of his/her chips in his/her two piles, then compare the number of chips in his/her two piles with that of the other player's two piles. Note that once a chip is placed in one pile it cannot be moved to another pile. There are four comparisons including Helen's P1 vs David's P1, Helen's P1 vs David's P2, Helen's P2 vs David's P1, and Helen's P2 vs David's P2. For each comparison, the player with more chips in the pile will score 5 point (the opponent will lose 5 point). If the number of chips is the same in the two piles, then nobody will score any points from this comparison. The final score of the game is the sum score over the four comparisons. For example, if Helen puts 5 and 1 chips in her P1 and P2, David puts 3 and 1 chips in his P1 and P2, respectively. Then Helen will get 5 (5 vs 3) + 5 (5 vs 1) - 5 (1 vs 3) + 0 (1 vs 1) = 5 as her final score, and David will get his final score of -5. (a) Formulate the payoff matrix for the game. (b) Explain what is a saddle point. Verify: does the game have a saddle point? ] (c) Construct a linear programming model for each player in this game. (d) Produce an appropriate code to solve the linear programming model for this game. (e) Solve the game for David using the linear programming model you constructed. Interpret your solution [Hint: To record the number of chips in each pile for each player you may use the notation (i, j), where i is the number of chips in P1 and j is the number of chips in P2, for example (2,4) means two chips in P1 and four chips in P2. Note that one pile could be empty.]