On a decision tree, once the tree has been drawn and the payoffs and probabilities have been placed on the tree, computing EMVs and selecting the best alternative is done by:

Group of answer choices

starting at the bottom of the tree and moving up$.$

working forward $($starting on the left and moving to the right$).$

startiing at the top of the tree and moving down

working backward $($starting on the right and moving to the left$).$