Answer:
The answer is "[tex]\bold{\frac{1}{n}}[/tex]"
Step-by-step explanation:
Although n passwords were available and any time a wrong password is deactivated. Throughout the second try, if the secretary finds the right password, its input during the first attempt should be incorrect. Therefore, the likelihood is:
[tex]\to Pr= \frac{n-1}{n} \times \frac{1}{n-1} =\frac{1}{n}[/tex]
If n passwords were accessible and any time the wrong password is deactivated. Unless the delegate finds the right password on the three trials, the input should be incorrect during the first and second trials. Consequently, the likelihood is:
[tex]\to Pr= \frac{n-1}{n} \times \frac{n-2}{n-1} \times \frac{1}{n-2} =\frac{1}{n}[/tex]