Can someone explain this without using the K part? or if you are using K explain where K is coming from.

1.46 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"0"| m, n >0} Ab. {0"1"|m#n}