Solve Description to Grammar problem Problem Find a grammar that recognizes the following language: The language of the strings a^i b^j c^k with either i=j20 and k21, or i=k20 and j1 (or i=j=k21). Grammar: o 1 production per line o start nonterminal: left-hand side of first production Productions: HELP: Grammar Syntax o form: S -> XY | a S b | leps o left-hand side: a single nonterminal o right-hand side: groups of nonterminals and terminals separated by "|" Nonterminals: o form: one single upper case character A-Z Terminals: o allowed: abcdefghijklmnopqrstuvwxyz([] Empty word: o empty word: E (write lepsilon or \eps or le)