Prove, by using the pumping lemma, that the language {w | 0 n₀(w) 2 n₁(w) + 1.} is not a regular language

no(wnumber of O's in w and ni(w)- number of 1's in w Prove, by using the pumping lemma, that the language is not a regular language