1. Show that the following languages are not regular using Pumping Lemma.

L1 = { www^R: w {a, b}* }

L2 = { aⁱ b^ja^i-1 : i, j 0 }