The following figure shows a zerosum game tree. For each node, we assume that the probability of the leftmost move is twice as much as any other move. The other moves, if there are more than one, have equal chance. $($a$)$ Find the Expectimax values at the three chance nodes, $C1,$ C$2,$ and C$3.($b$)$ Find the Expectimax value at the root.

Player $1,$ Depth $0$

Chance

Player $2$