Automata
Language, L = {an | n ≥1}, check whether this language is regular or not
As we can see that there is a pattern in the language and FA can be generated so we are good to say that
Yes, this is a regular language.
Below is the DFA for above question:





Quantitative Aptitude
Reasoning
Programming
Interview