Problem 3. [35 points] For each language, either prove the language is regular (by creating an implementation with your choice of a DFA, NFA, RegEx, Regular Grammar, or using closure properties), or prove that it is not regular (by either using the pumping lemma or closure properties). (d) {a"1n21 (e) a bak In > 5,1 > 3,k 2) (f) (a ba n >5,l> 3,k sn)