Games (45 PS a. Complete the following table by provide an example game for each case: Fully observable Partially observable Deterministic Stochastic b. Consider the following game in which each player has two options: 1) make a move involving chance, or 2) making a risk free move. Use the ExpectiMiniMax algorithm to calculate the utility of each node 0.6 0.4 0.2 0.8 0.9 0.1 0.3 0.7 4 3 9 8 2 5 7 1 6 c. In the abovementioned game, what is the best move for the blue player? D) Making the move involving chance, or 2) making a risk-free move. Why? Explain our answer in terms of the utility of two options, d. The abovementioned game tree is part of a depth-limited adversarial search. How do we calculate the utility of leaf nodes in a depth-limited adversarial search? e. What was the benefit of Alpha Beta pruning over the MiniMax algorithm