Using the Fundamental Counting Theorem, it is found that for each case, the total number of outcomes is:
a) 60,466,176.
b) 5,961,600.
<h3>What is the Fundamental Counting Theorem?</h3>It is a theorem that states that if there are n things, each with ways to be done, each thing independent of the other, the number of ways they can be done is:
Item a:
No restrictions, hence for each of the five characters, there are 36 outcomes, hence .
Then, the possible number of passwords is:
Item b:
The letters and the digits have to be alternated, hence:
- Starting with a letter,
.
- Starting with a digit,
.
Then, the possible number of passwords is:
To learn more about the Fundamental Counting Theorem, you can take a look at brainly.com/question/24314866