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) w E 1a, b, c (c) uwwRv u, v, w E (a, b)+) (d) {a"1 | n21) (f) fa"b'ak |n > 5,1> 3, k