Consider the following 2-player game. Cookies are laid out on a rectangular grid n m. The cookie in the top left position is poisoned, as shown in Figure below. The two players take turns making moves; at each move, a player is required to eat a remaining cookie, together with all cookies to the right and/or below it (see Figure 2, for example). The loser is the player who has no choice but to eat the poisoned cookie. Draw the search (entire game tree) tree for this game in a 3 x 3 grid. Initially Player A Player B Player A Player B OOOOO 000 Consider the following 2-player game. Cookies are laid out on a rectangular grid n m. The cookie in the top left position is poisoned, as shown in Figure below. The two players take turns making moves; at each move, a player is required to eat a remaining cookie, together with all cookies to the right and/or below it (see Figure 2, for example). The loser is the player who has no choice but to eat the poisoned cookie. Draw the search (entire game tree) tree for this game in a 3 x 3 grid. Initially Player A Player B Player A Player B OOOOO 000