Show that the symmetric group of degree 3 $S_3$ has 6 automorphisms.
I can understand the argument that each transposition must permute. 3 transpositions gives $3! = 6$.
But the argument given in my textbook says the following.
$S_3$ can be represented as $\{1, \sigma, \sigma ^2, \tau, \tau\sigma, \tau\sigma ^2\}$ (i.e. isomorphic to the dihedral group of order 6), where $o(\sigma)=3$ and $o(\tau)=2$. Here I denote $o(x)$ to mean the order of the element $x$. So if $\theta$ is an automorphism then $o(\theta(\sigma))=o(\sigma)=3$, so $\theta(\sigma)=\sigma \text{ or } \sigma^2$ because $o(\sigma)=o(\sigma ^2)=2$.
I understand the argument up to here, but what follows I don't understand.
Similarly $\theta(\tau)=\tau, \tau\sigma \text{ or } \tau\sigma ^2$
They conclude that there are at most $2\cdot 3=6$ choices for $\theta$, which completes the solution based on a previous observation that $|\text{inn}S_3|=6$ and $\text{inn}S_3\subseteq\text{aut}S_3$.
My confusion is that I computed $o(\tau\sigma)$ and $o(\tau\sigma ^2)$ to be $6$, not $2$, whereas $o(\tau)=2$. Using this logic, there should be $1\cdot2\cdot1\cdot2=4$ automorphisms, where the identity element is sent to itself and $\tau$ is sent to itself.
It would really help me if somebody could list each of the 6 automorphisms so that I can clearly see why there are 6.
I apologize if this question has been answered before; I'm in a rush.