Exercise 2. [35 points]. Part (a). Give a context-free grammar which will generate the following language, when Σ= {a,b,c} : L={a i
b j
c k
∣(i=j)∨(j=k)} Part (b). Give the derivation (both in tree formal and in sequence) for the following strings: ab, aaabbbcc, abbcc