With the help of Pumping Lemma prove that the following language is not regular:

a) L = {0ⁿ1ⁿ1^m0^m | n1, m1} U

{0ⁿ1^m1^m0ⁿ | n1, m1}

b) L = {aⁿbⁿc^md^m | n=m 1} U

{aⁿb^mc^mdⁿ | n = m 1}