(5 pts.) Determine whether the following language is regular or non-regular. If regular, provide a DFA, NFA, or a regular expression for the language. If non-regular, prove it using the pumping lemma or closure properties for regular languages L = { ai b/ckl where i,j, and k are non-negative integers such that i mod k }