Give a context-free grammar that generates the language
A = {aⁱb^jc^k| i = j or j = k where i, j, k ≥ 0}. 

Is your grammar ambiguous? Why or why not? (if yes, please draw the parse trees.)