L1 = {w {a}^* | w = a^2k with k 0} So the language L1 contains only words that consist of a number a that corresponds to a power of two. Example a, aa, aaaa, aaaaaaaa, etc.

L2 = {aⁱ b²ⁱ | i 0}.

Prove or disprove that the languages shown are context-free languages. Use the pumping lemma to refute the claim.