Give a combinatorial argument to prove that the number of derangements satisfies the following relation:
$$d_n = (n ā 1)(d_{nā1} + d_{nā2})$$
for $n \geq 2$.
I am able to prove this algebraically but not able to see the combinatorial example.