Assignment:
Q1)For each of the following languages over the unary alphabet {a}, construct a finite automaton accepting it.
i. {a^2}
ii. {a^2, a^3, a^4}
Q2) Let A be any finite nonempty subset of {a, a^2, a^3, a^4,...}. Is there always a finite automaton that accepts A?
Provide complete and step by step solution for the question and show calculations and use formulas.