Use the pumping lemma to prove that the following languages are not regular.
(i) L1 = {1²n | n > 1}, Σ = {1}.
(ii) L2 = {0ᵏ1ᵘ0ᵏ | k > 1 and u ∈ Σ*}, Σ = {0, 1}.
a) L1 is regular, L2 is not regular
b) L1 is not regular, L2 is regular
c) Both L1 and L2 are regular
d) Both L1 and L2 are not regular