Let \(n\geq 1\) be a fixed integer and recall that there are \(n!\) permutations of \([n]:=\{1,\ldots ,n\}\). Let \(\sigma :=\{\sigma (1),\ldots ,\sigma (n)\}\) denote an arbitrary permutation of \([n]\), and choose and fix some integer \(j\in [n]\). We say that \(\sigma \) fixes \(j\) if \(\sigma (j)=j\). Now suppose that \(\sigma \) is selected at random, all permutations of \([n]\) equally likely.
(a) What is the probability that \(\sigma \) fixed \(j\)?
(b) What is the expectation of the number of integers in \([n]\) that are fixed by \(\sigma \)?