A student defines a sequence $E_n = D_n / n!$, where $D_n$ is the number of derangements of $\{1, 2, \dots, n\}$. Which of the following recursive relations correctly describes $E_n$ for $n \geq 1$ with $E_0 = 1$?