Match the following lists.
The conditions on the language description $L = \{a^i \ b^j \ c^k\}$ are given in List I and respective grammars are given in List II.
$\begin{array}{|c|c|c|c|} \hline {} & \text{List I} & {} & \text{List II} \\ \hline A. & k=i+j & G_1: & S \rightarrow aSc\mid B; B \rightarrow aBb\mid \epsilon \\ \hline B. & k=i+2j & G_2: & S \rightarrow aSc\mid B; B \rightarrow bBcc\mid \epsilon \\ \hline C. & i=j+k & G_3: & S \rightarrow aSc\mid B; B \rightarrow bBc \mid \epsilon \\ \hline \end{array}$
- $A:G_1, B:G_2, C:G_3$
- $A:G_3, B:G_2, C:G_1$
- $A:G_1, B:G_3, C:G_2$
- $A:G_3, B:G_1, C:G_2$