On a decision tree, once the tree has been drawn and the payoffs and probabilities have been placed on the tree, the analysis (computing EMVs and selecting the best alternative):

a) is done by working backward (starting on the right and moving to the left).

b) is done by working forward (starting on the left and moving to the right).

c) is done by starting at the top of the tree and moving down.

d) is done by starting at the bottom of the tree and moving up.