1. True or false? Give brief justifications. (a) In a fully observable, turn-taking, zero-sum game between two perfectly rational players, it does not help the first player to know what strategy the second player is using-that is, what move the second player will make, given the first player's move. (b)A perfectly rational chess-playing agent that moves first (White) never loses.
2. Draw a hypothetical game tree with branching factor at most 3 and at most 4 plies fora fully observable, turn-taking, zero-sum game between two perfectly rational players MAX and MIN. Calculate the utility value at the root node. Your game tree should include examples of both alpha pruning and beta pruningthat can be applied for MAX's search.Briefly explain how the pruning happened and what parts of the tree are pruned in the search (you can highlight those parts).
Attachment:- adversarial_search.pdf