Design an algorithm that can lead to enumerating all possibilities without redundancy and give the total number of possibilities that can lead to win this game.

A gamer should take consecutively 4 balls from an urn that contains an infinite number of balls having 4 different colors: White, Red, Green and Yellow. This gamer can win if and only if three of the 4 balls he takes have the same color.
Design an algorithm that can lead to the following results:
1.Enumerate all possibilities without redundancy.
2.Give the total number of possibilities that can lead to win this game.