In a single$-$stage decision tree problem, you make first and then all you wait to see a$($n$)$

a$)$ calculations; known outcome

b$)$ likelihoods; uncertain outcome

C$)$ decisions; uncertainty outcome

d$)$ EMV calculations; certain events