5. (Non-CFLs) Prove that the following languages are not context-free.

(b) The following language over the alphabet {a, b, c}:

B = {aⁱx | i 0, x {b, c}^* , and if i = 1 then x = ww for some string w}.

(Careful: B satisfies the pumping lemma for CFLs! Make sure you understand why, but you dont need to write it down.)