Assign values to each empty maximizer, minimizer and chance node in the graph below according to the rules of each type of node. For chance nodes, assume that each successor is twice as likely to be taken as the successor immediately to the right on the graph $($e$.$g$.,$ if $3$ successors, it is twice as likely to take the left successor vs$.$ the middle successor and twice as likely to take the middle successor than the right successor$).$