When solving a decision tree: (Select all that apply)

We calculate the expected value of each node one by one, starting from the left- most to the right-most node.

For each chance node, we compute the expected value by choosing the branch with the highest expected value downstream

For each decision node, we compute the expected value by taking the weighted (by probability) average of downstream expected values over the connected branches

We can only solve the nodes from right to left since computing expected value of a node requires the expected values of those to the right (downstream) of it.

When solving a decision tree: We calculate the expected value of each node one by one. starting from the leftmost to the right-most node. For each chance node, we compute the expected value by choosing the branch with the highest expected value downstream For each decision node, we compute the expected value by taking the weighted (by probability) average of downstream expected values over the connected branches We can only solve the nodes from right to left since computing expected yalue of a node requires the expected values of those to the right (downstream) of it. When solving a decision tree: We calculate the expected value of each node one by one, starting from the leftmost to the right-most node. For each chance node, we compute the expected value by choosing the branch with the highest expected value downstream For each decision node, we compute the expected value by taking the weighted (by probability) average of downstream expected values over the connected branches We can only solve the nodes from cight to left sinke computing expected value of a hode requires the expected values of those to the right (downstresm) of it