I am just writing this answer to better understand myself. Basically this is an extension of
GMATBusters 's solution.
So let us assume we have 3 Green, 3 Blue and 3 Red balls (no restrictions to pick any colours). The main idea is as long as we have 3 balls of each there is no restriction, which means 6 green here just tells you you have "no restriction" on green, so the permutation GGG is allowed.
The other thing we have to realise is we are looking for distinct sets. This means GGR and GRG is the same, because it has 2 greens and 1 red. This is important.
Now Bunuel used "d" so I am going to use the same in his theory.
d = occurrence of a ball
We have 2 separators || and 3 buckets so as to speak _ _ _
Looks like this
_|_|_
Now each bucket represents occurrence of Green, Blue or Red. (this is the part which is slightly different from Bunuel's problem)
Filling "d" in the first bucket means occurence of a green ball. Filling the second bucket with "d" means occurrence of a blue ball.
Therefore, ddd|| signifies the GGG occurrence.
I will list all possible occurrences, for those finding it hard to visualise
ddd|| --> 3G
|ddd| --> 3B
||ddd --> 3R
dd|d| --> 2G 1B
dd||d --> 2G 1R
d|dd| --> 1G 2B
|dd|d| --> 2B 1R
d||dd| --> 1G 2R
|d|dd| --> 1B 2R
d|d|d --> 1G 1B 1R
Which means we need to find out the permutation of (3+2) = 5 in a straight line. But the 2 separators and 3 occurrences are indistinguishable.
Therefore, required permutation = \(\frac{5!}{3! 2!} \)= 10
Now this is if we have no restrictions, remember we said 3G, 3B nd 3R
But in essence we only have 2 reds.
So the occurrence |||ddd will not happen. This is the RRR occurrence.
I hope this helps.