2 THE ASSIGNMENT (a) Four friends are playing a team-based version of hide-and-seek. They divide themselves into two teams. Two of the four friends will hide, while the other two will seek. There are four hiding locations: living room, kitchen, dining area and backyard. The hiders must hide in separate locations, while the seekers can only search 2 locations. It is assumed that the seekers will find anyone hiding in a location when searching that particular location. The hiders win 1 point if neither hider is found by the seekers. The seekers win 1 point if they find both of the hiders. The teams tie if only one hider is found by the seekers. There are no points for a tieConstruct a payoff matrix for the hiders. Do not solve the game. (b) Solve the following game between Alan and Bob. The payoff matrix (in RM) is for Alan. [33] Bob Bi BBB A9 6 2 8 Alan Az 8 9 4 5 A3 7 5 25