Alphabet & $=\{0,1\}.$ For the language

x $=\{0"^|$ m$,$ n $>=1$ and m$=$ n;

Please answer these two questions:

$$Is the language regular or non$-$regular?

$$If your answer is regular, please provide either a DFA, NEA or regular expression $($choose only one$)$ that recognizes the language. If your answer is non$-$regular, please prove it by contradiction using Pumping Lemma.