Answer is (C)
Using static Huffman compression you can encode the more common colours in fewer bits than the rare colours, that being the case on can expect that common colours will usually be chosen.
eg:
$\begin{array}{llll} \text{red} & 1 \\ \text{blue} & 01 \\ \text{green} & 001 \\ \text{white} & 0001 \\ \text{black} & 0000 \\ \end{array}$
On average from $16$ draws there will be
$\begin{array}{llll} \text{8 reds} & = \ \text{8 bits} \\ \text{4 blues} & = \ \text{8 bits} \\ \text{2 greens} & =\; \text{6 bits} \\ \text{1 white} & = \ \text{4 bits} \\ \text{1 black} & = \ \text{4 bits} \\ \end{array}$
for a total of $\dfrac{30}{16} =\dfrac{15}{8}$ bits on average.