None. Pumping lemma can be used to show that some language is Not regular.
If the given language $L$ does not satisfy pumping lemma for regular languages then It is can never be Regular language. But if a language satisfies pumping lemma for regular languages then it may or may not be Regular language because some Non-regular languages also satisfy pumping lemma for regular languages.
But pumping lemma has No connection with Showing a Grammar is Regular or Not.
Hence, None is correct.