Consider the game of Monopoly https://en.wikipedia.org/wiki/Monopoly. For Monopoly answer the following questions:

I. Model the Monopoly game as an adversarial search problem

II. Would you use minimax or expectimax search to solve MONOPOLY? Explain your reasoning

III. What will be the complexity of adversarial search for MONOPOLY?

IV. Draw the search graph of expectimax search for a turn for each player, assuming there are four players. One is controlled by you.

V. Will it be feasible to do a vanilla search for solving Monopoly? Why or why not?

VI. Will you design an optimistic agent or a pessimistic agent for Monopoly? explain your reasoning

VII. How would you speed up the decision-making process of your algorithm? Explain the improvements you would make and why they will be helpful