A context free language is called ambiguous if _________

• A. It has 2 or more left derivations for some terminal string ѡ є L (G)
• B. It has 2 or more right derivations for some terminal string ѡ є L (G)
• C. It has 2 or more left & right derivations for some terminal string ѡ є L (G)
• D. None of the mentioned