I want to prove that the complement of $\{0^n1^n \mid n \geq{} 0\}$ is not regular using closure properties.I understand pumping lemma can be used to prove that $\{0^n1^n \mid n \geq{} 0\}$ is not a regular language. I also understand regular languages are closed under complement operation. However, does that also imply that a non-regular language's complement is also non-regular?
Prove that the complement of  $\{0^n1^n \mid n \geq{} 0\}$ is not regular using closure properties
formal languages;regular languages;closure properties