I need the solve for this Automata and Computability course problem solution.

Segment 1.1: String Detection 3.0 points possible graded results hidden Consider the following grammar G where is the start symbol S - ABCD A 04101 B-2012 COCOD D - 1022 122 Q1. Which of the following strings can be produced by the variable C? 000 00121 1111 0112222 Q2. Which of the following strings is in the language of the grammar G? 000112222 0000111222212 00122122 0000222 Q3. Which of the following languages is the language of G? OL = {ww = 0 V2, where i,j,k 2 1 and i = jor i = k} L = [ww = 0 v2 where ij, k 2 1 and i = j or w = 0 V217 where 2j = k and 21 = m} OL = (ww = 0 1 2*, where i.JikO and i = and i = k) OL = {ww = 0 V2, where ij, k 21 and i = j or 2= k}