Automata

Consider the following languages over the alphabet fa, b) A := {(ab)" : n 0), B := {a"bn : n > 0), Caa n 20), For each of these languages, answer if it is regular or not. Prove it either with an DFA/NFA/RE or 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