Felix (a Cat) and Chippy (a Chipmunk): I often look out my kitchen window at a chipmunk eating below the bird feeder and a cat lurking in the bushes a short distance away. Here is a game related to what I observe. Felix and Chippy simultaneously enter the following blind maze (blind meaning neither player can see over the walls). The 12-line segments (denoted below by small letters a-l) comprising the maze indicate possible paths. Felix and Chippy may turn corners, but they cannot turn around or backup. Entering the maze at the same time and traveling at the same speed, each of them has enough time to cover of the maze (equal to three-line segments), at which time Chippy is rescued, if Felix hasnt already eaten him. If Chippy is rescued, he wins (+1) and Felix loses (-1). If Felix and Chippy meet at a point before Chippy covers of the maze or, if Felix meets Chippy at the point where Chippy covers of the maze, Felix eats ChippyFelix wins (+1) and Chippy loses (-1). Find all Nash equilibria and solve this game using the payoff matrix on the next page. Below the matrix show all calculations and steps taken to solve the game. Hint: each player has 8 pure strategies, which you should denote by using small letters attached to possible paths. Start by entering the remaining strategies in the matrix for each playertwo sets of strategies with payoffs has been entered for you (e.g., eji is Chippys pure strategy path traveling along line segments e, j and i).

Felix is the ROW player. Now find all pure strategy equilibria and mark each with a *. The number of *s you placed in the matrix equals___________. Now eliminate all stupid strategies and show all work below; be very specific when describing what you are doing.