Discrete Math

Let G-(V, T, S, P) be the phrase-structure grammar with V= {0, 1, S. T3(0, 1), starting symbol S, and productions S--OS1 and S ?. Click and drag statements to show that G generates the set {On 1 n I n-0, 1, 2, ). Apply the rule SS1 once Apply the rule S ? 0S1 n times. On the other hand, no other derivation is possible, because once the rule S-, ? is used, the derivation stops. Apply the rule S ? once. Apply the rule S ? ? n times. The string 0"1" results. The string 0"1 results