Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, and complement.

a. {0ⁿ1^m0ⁿ| m, n ≥ 0}

^Ab. {0^m1ⁿ| m ≠ n}

c. {w| w ∈ {0,1}^* is not a palindrome}⁸

^*d. {wtw| w, t ∈ {0,1}⁺}