Long description

Decision tree: two branches, the top is for A and bottom is for B.

Following the top branch (for A) you come to a chance node called ‘win’ which then splits into two further branches, for the party, called J and K. Each of these branches arrives at another chance node called ‘friendly’. This is repeated in the lower branch for B.