Consider the election game with nine possible regions at which vendors may locate. Suppose that rather than the players moving simultaneously and independently, they move sequentially. First candidate 1 selects a location. Then after observing the decision of candidate 1, candidate 2 chooses where to locate. Using backward induction to solve this game. Remember that you need to specify candidate 2 sequentially optimal strategy for every action of candidate 1.