Probability that both roads from a to b are blocked is the product of the individual probabilities, i.e.
P(~ab)=0.25*0.25=0.0625
Similarly
P(~bc)=0.25*0.25=0.0625
Probability that EITHER one or both of ab and bc are blocked is the sum of the probabilities:
P(~ab ∪ ~bc)=0.0625+0.0625=0.125
(recall that one cannot travel from a to c if either ab or bc is blocked.)
Therefore the probability that there exists an open route from a to c
= P(ac) = 1-P(~ab ∪ ~bc)
= 1 - 0.125
=0.875
The answer is B) add 1.25 and 2.70 and subtract that from 10.00
Answer:
There are 17,418,240 different ways to choose the teams.
Step-by-step explanation:
Arrangements of n elements:
The number of possible arrangements of n elements is given by:

In how many different ways can the teams be chosen so that the number of employees on each project are as follows: 9, 4, 2?
This is:
Arrangement of 9 elements, followed by an arrangement of 4 elements followed by an arrangement of 2 elements. So

There are 17,418,240 different ways to choose the teams.
(4-3n-5n2)
+( -2+n-3n2)
____________________
-2-2n-8n2