3. Consider the context-free grammar G, (where S is the start variable). SOA | OBO | OSO A - SO B-1B 1 I) Give a verbal description of the language generated by this grammar. II) Show that this grammar is ambiguous by demonstrating a string that has two distinct leftmost derivations from G. III) Specify which productions you will drop from this grammar to make it non-ambiguous. Your new grammar should generate the same language, but should not be ambiguous.