The number of different possible passwords is 20.
What is the Fundamental Theorem of Counting?
It is a theorem that claims that if there are n things, each with [tex]n_{1} ,n_{2} ..............n_{n}[/tex] methods to perform them, the total number of ways they can be done is: [tex]N=n_{1} \times n_{2}\times...........\times n_{n}[/tex].
How to many different passwords possible?
In this instance: because the first three characters are fixed, [tex]n_{1} =n_{2} =n_{3} =1[/tex]
The last two are unique digits from a set of five.
Hence, [tex]n_{4} =5,n_{5} =4[/tex]
Then, [tex]N=n_{1}. n_{2}. n_{3} .n_{4} .n_{5} =5(4)=20[/tex]
There are a total of 20 possible passwords.
Learn know more about Fundamental Counting Theorem here, https://brainly.com/question/4747487
#SPJ2
