$3.$ Pumping Lemma ProofProblem: Prove that the binary language $\backslash \{0^$n$1^$n$0^$n $|$ n $\backslash$geq $0\backslash \}$ is not regular using the Pumping Lemma.Approach:$1.$Assume that the language is regular and that the Pumping Lemma applies$\mathrm{.}2.$Choose a string s $=0^$n$1^$n$0^$n where n is large enough, and show that no matter how you pump the string, it will not remain in the language, thus leading to a contradiction.