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

$$

$=$

$\{$

$1$

$$

$$

$$

is prime

$\}$

A$=\{1$

n

$$n 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$.$