Counting & Probability · Superchallenge problem

A derangement of $\{1,2,\dots,10\}$ is a permutation with no fixed points. How many derangements of $\{1,2,\dots,10\}$ send $1$ to $2$?