2001 Pascal Problem 12

A bag contains 20 candies: 4 chocolate, 6 mint and 10 butterscotch. Candies are removed randomly from the bag and eaten. What is the minimum number of candies that must be removed to be *certain* that at least two candies of each flavour have been eaten?

\textbf{(A)}\ 6\quad \textbf{(B)}\ 10\quad \textbf{(C)}\ 12\quad \textbf{(D)}\ 16\quad \textbf{(E)}\ 18

If there are no answer choices shown, enter a numerical answer.

Full credit to this problem is given to the CEMC, you may view all Pascal contests here.