Which of the following are true when solving a decision tree? O The value of a decision node is computed by taking the weighted average of the successor nodes' values. The decision tree represents a time ordered sequence of decisions and events from left to right. The values of the terminal nodes are weighted averages. O Exactly two of the answers are correct. O The EMV of an event node is computed by taking the weighted average of the predecessor nodes' values.