Label the threads R1,R2,Y,G so that all outcomes are equally likely. The tree has 4 branches for the first pick and, since the thread is put back, 4 branches again for the second pick: 4×4=16 complete paths. They are shown in the table (first pick, second pick).
| First pick / Second pick | R1 | R2 | Y | G |
|---|
| R1 | R1R1 | R1R2 | R1Y | R1G |
| R2 | R2R1 | R2R2 | R2Y | R2G |
| Y | YR1 | YR2 | YY | YG |
| G | GR1 | GR2 | GY | GG |
(i) Exactly one red: red then not red (R1Y,R1G,R2Y,R2G) or not red then red (YR1,YR2,GR1,GR2), that is 8 paths.
P(exactly one red)=168=21
(ii) Neither is yellow: both picks are from R1,R2,G, which gives 3×3=9 paths.
P(no yellow)=169
(iii) At least one green: the paths with no green are the 3×3=9 paths using only R1,R2,Y, so the remaining 16−9=7 paths have a green (R1G,R2G,YG,GR1,GR2,GY,GG).
P(at least one green)=167