Creating a decision tree

Problem 4-05 (Algorithmic)
In American football, touchdowns are worth 6 points. After scoring a touchdown, the scoring team may subsequently attempt to score 1 or 2 additional points. Going for 1 point is virtually an assured success, while going for 2 points is successful only with probabilityp. Consider the following game situation. The Temple Wildcats are losing by 14 points to the Killeen Tigers near the end of regulation time. The only way for Temple to win (or tie) this game is to score two touchdowns while not allowing Killeen to score again. The Temple coach must decide whether to attempt a 1-point or 2-point conversion after each touchdown. If the score is tied at the end of regulation time, the game goes into overtime. The Temple coach believes that there is a 45% chance that Temple will win if the game goes into overtime. The probability of successfully converting a 1-point conversion is 1.0. The probability of successfully converting a 2-point conversion isp.

Assume Temple will score two touchdowns and Killeen will not score. Create a decision tree for the decision of whether Temple’s coach should go for a 1-point conversion or a 2-point conversion after each touchdown. The terminal nodes in the decision tree should be either WIN or LOSE for Temple.Success (p)Go for 26Win OT (45%)Success3Fail (1-p)10Lose OT (55%)Go for 22Go for 1Win OT (45%)Success (p)11Go for 27Lose OT (55%)4Fail (1-p)1Go for 1Success (p)Go for 28Fail (1-p)5Win OT (45%)Go for 19Lose OT (55%)
Assume that a WIN results in a value of 1.0 and LOSE results in a value of 0. Further, assume that the probability of converting a 2-point conversion isp= 32%. Should Temple’s coach go for a 1-point conversion or 2-point conversion after scoring the first touchdown?The Temple coachfor 2 points after the first touchdown.