Build graph with exactly n automorphisms

Question

Construct graph with exactly distinct n automorphisms. For n $\geq$ 2.
I wonder if we can just take an asymmetric graph, such as this one as building block.

Answer 1

This graph has exactly five automorphisms:

And it's easy to see how to construct a similar graph with $n$ automorphisms for any $n\ge 3$.

Answer 2

Frucht's Theorem says that every finite group can be realized as the group of automorphisms of a graph, and the Wikipedia essay gives some idea of the proof, and some links.

Of course, for every $n$ there is a group of order $n$.