Consider the following languages over the alphabet = {a,b}: A= {(ab) | n >0} B = {a b| n >0} C = {a" a" | n >0} D= {a" km | n > m} For each of these languages, answer if it is regular or not. Then, prove it either by creating an DFA/NFA/RE or by using the pumping lemma. Make sure your proofs are clear, understandable, and legible. Include full sentences that describe your line of reasoning, not just formulas. Consider the following languages over the alphabet = {a,b}: A= {(ab) | n >0} B = {a b| n >0} C = {a" a" | n >0} D= {a" km | n > m} For each of these languages, answer if it is regular or not. Then, prove it either by creating an DFA/NFA/RE or by using the pumping lemma. Make sure your proofs are clear, understandable, and legible. Include full sentences that describe your line of reasoning, not just formulas