Let $A = \{x_1, x_2, x_3, x_4\}$ and $B = \{y_1, y_2, y_3, y_4\}$. $A$ function $f: A \to B$ is defined. The number of one-one functions such that $f(x_i) \neq y_i$ for $i = 1, 2, 3, 4$ is equal to:

There are $4$ balls of different colors and $4$ boxes of the same colors. In how many ways can the $4$ balls be placed in the boxes,one in each box,such that no ball goes into a box of its own color?

Consider a square matrix of order $5$ such that $a_{ij} = 0$ for all $i + j = 6$,where $a_{ij} \in \{0, 1\}$ for all $i, j$. In each row as well as in each column,there is only one non-zero element. Then,the number of such matrices is:

There are $n$ letters and $n$ addressed envelopes. The probability that all the letters are not kept in the right envelope is:

$A$ person writes letters to $6$ friends and addresses the corresponding envelopes. In how many ways can the letters be placed in the envelopes so that at least two of them are in the wrong envelopes?
Notation : $D_n = n! \left( \sum_{i=0}^n \frac{(-1)^i}{i!} \right)$

Three letters are dictated to three persons and an envelope is addressed to each of them. The letters are inserted into the envelopes at random so that each envelope contains exactly one letter. Find the probability that at least one letter is in its proper envelope.