The number of derangements of n elements is defined as do 1, d1 0, and for n 1: dn n 1)(d dn-2). Define a n-1 recursive Python function to compute dn. Use memoization to make the function efficient