In this question, player A is a minimizer, player B is a maximizer, and C represents a chance node. All children of

a chance node are equally likely. Consider a game tree with players A$,$ B$,$ and C$.$ In lecture, we considered how to

prune a minimax game tree $-$ in this question, you will consider how to prune an expinimax game tree $($like a minimax

game tree but with chance nodes$).$ Assume that the children of a node are visited in left$-$to$-$right order.