Problem Find a grammar that recognizes the following language: The language of the strings a^i b^j c^k with either i=j or i=k (or i=j=k)