Option (A) is correct.
Explanation:
This is a multi-step experiment: first the spin, then the toss. A tree diagram has 3 branches for the spinner, and from each of them 2 branches for the coin. Each complete path from start to end is one outcome:
- Red: (Red, H), (Red, T)
- Green: (Green, H), (Green, T)
- Yellow: (Yellow, H), (Yellow, T)
So there are 3×2=6 equally likely outcomes, and only one of them, (Green, H), is a win:
P(green and heads)=61
Why the other options are wrong
- (B) 51 adds the 3 colours and the 2 faces to get 5 outcomes. But each outcome is a pair (colour, face), so the outcomes are counted along the paths of the tree: there are 6, not 5.
- (C) 31 is the probability of green alone. It ignores the coin; Arjun also needs heads.
- (D) 21 is the probability of heads alone. It ignores the spinner; Arjun also needs green.