Q3:\ There's a simple game you can play with silver dollars. (A silver dollar is a coin worth $1). There are five (5) silver dollars on the table and you and your opponent take turns picking up 1, 2, or 3 coins until none is left. You get to keep each silver dollar you pick up. But, if you pick up the last coin, you have to pay $2 to your opponent. The object of the game is to finish with the most money. Consider building a game tree to solve the above problem where each state in the game tree represents the number of coins left on the table. - What utility function should you use to evaluate terminal nodes? - Your opponent offers to let you go first. • If you accept, what is your first move? How much will you earn? • Should you accept? Briefly explain your answer.

Q3:\ There's a simple game you can play with silver dollars. (A silver dollar is a coin worth $1). There are five (5) silver dollars on the table and you and your opponent take turns picking up 1, 2, or 3 coins until none is left. You get to keep each silver dollar you pick up. But, if you pick up the last coin, you have to pay $2 to your opponent. The object of the game is to finish with the most money. Consider building a game tree to solve the above problem where each state in the game tree represents the number of coins left on the table. - What utility function should you use to evaluate terminal nodes? - Your opponent offers to let you go first. • If you accept, what is your first move? How much will you earn? • Should you accept? Briefly explain your answer.