Similar to what happened with the enigma machine, we are interested in permutations of N symbols in which no symbol is mapped to itself. a) What is the total number of ways to generate a permutation of N symbols? b) How many of these are permu- tations in which no symbol is mapped to itself? c) What happens to this number as N approaches infinity