Prove that the language $L_1 = \{a^ib^{2i}c^j \;|\; i,j ≥ 0\}$ is context-free.
I have a grammar like this but there are some strings that are not be able to be generated
$$\begin{align} S &\to aSbb \;|\; C \\ C &\to cC \;|\; \epsilon \end{align}$$
One example is the string $abbc$ cannot be generated.