to show that a language l is regular, one could group of answer choices create a dfa, nfa, regular expression or use closure properties one can not show that a language is regular use the pumping lemma for regular languages create a dfa, nfa or regular expression