I need help with this question please. I don't understand how to solve it. If you can give an explanation on how you solved it that would be great! Thank you in advance!

For the purpose of this exercise, a language is regular if it is decided by any one of the following: DFA, regex, RRG, or NFA. Let A={1nn is prime }. We will later show that A is not regular. Show that A is regular by giving a DFA, regex, RRG, or NFA for it. Hint: Start by writing concrete examples of small strings in A and look for a pattern