We used indicator random variables in the proof of the expected running time of RANDOMIZED-QUICKSORT. For this problem, you should read about indicator variables and the hiring problem in Sections 5.1 and 5.2 of the textbook. As part of a cryptography assignment in CMSC 426, a student has written code to generate random permutations P on a set of n characters. If the permutation leaves too many inputs unchanged, it might result in a weakness in the system. Assuming the permutations are truly random, how many characters do I expect to be left unchanged by the permutation