Acertain organization recommends the use of passwords with the following format: consonant comma consonant comma vowel comma consonant comma vowel comma consonant comma number (for example, prinay 6). assume that repeats are allowed. complete parts (a) and (b). (a) assuming passwords are not case sensitive, how many such passwords are possible (assume that there are 5 vowels and 21 consonants)? nothing (simplify your answer.) (b) how many passwords are possible if they are case sensitive?

.95

step-by-step explanation:

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation: