if anyone can help me with these I would appreciate it, I just want to know how to work them out.

Question 1 (20 points): Consider the following 4-ply zero-sum game. Assume both MAX and MIN agents are playing rationally. Answer the following questions: (a) In the deterministic game (ignore p on the branches for this section), What will be the value state at the root for the MIN agent? What is the suitable algorithm for solving this problem? (b) Can we use alpha-beta pruning for this game? If so, which part of the tree can be pruned and why? (c) In the stochastic setting, MAX agent takes the left action with probability p=0.8 and the right action with probability of 0.2, repeat part (a) and (b) Question 2 (20 points): In a full-depth minimax search of a tree with depth d and branching factor b, with pruning, what is the minimum number of leaves that must be explored to compute the best move? Explain. Question 3 (20 points): Consider the following multiplayer game where each player tries to get the maximum score. The terminal utility is specified by a tuple of (A's score, B'score, C's score). (a) Compute the values in each state. (b) Do you think we can prune this tree? How? Question 4 (20 points): Which of the following statements are true or false? Explain. (a) Alpha-beta pruning may find an approximately optimal strategy, rather than the minimax optimal strategy. (b) Alpha-beta prunes the same number of subtrees regardless of the order of child nodes. (c) For every game tree, the utility obtained by MAX using minimax decisions against a suboptimal MIN will never be lower than the utility obtained playing against an optimal MIN. (d) In expectiminimax search with two players, one max and the other chance, one can use pruning to reduce the search cost