Use the pumping lemma to show that the following languages are not regular

a) L = { 0ⁿ1ⁿ2ⁿ | n 0 }

b) L = {www | w {a, b}^*}

c) L = = { aⁱb^j | j = i or j = 2*i }