The following grammar with start symbol S generates the language {aⁱ b^j c^k : i = j or j = k}:

S XC S AY X aXb X

C cC C A aA A

Y bYc Y

(a) Show that this grammar is ambiguous. Hint. Consider a string that has an equal number of a, b, and c.

(b) Is this language inherently ambiguous? State your thoughts one way or another (you only need to provide your thoughts, not a proof).