Question 6: Let A be a language consisting of finitely many strings I. Prove that A is a regular language 2. Let n be the maximum length of any string in A. Prove that every deterministic finite automaton (DFA) that accepts A has at least n +1 states. (Hint: How is the pumping length chosen in the proof of the Pumping Lemma?)