Answer:
7.1
Step-by-step explanation:
If you do the math you get 13.95 meaning the nearest whole number would be 14
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
Answer:
462 paths from A to B
Step-by-step explanation:
The question is incomplete. However, a possible question is to determine the number of possible paths on the grid map.
The first step is to represent the grid map itself. (See attachment 1)
From the question, we understand that:
- Only right movement is allowed in the horizontal direction
- Only up movement is allowed in the vertical direction
There are a several number of ways to navigate through. However, one possible way is in attachment 2
In attachment 2,
- R represents the right movement
- U represents the up movement
And we have:
and 
The number of possible paths (N) is then calculated as:

Substitute values for N and U





<em>Hence, there are 462 possible paths from A to B</em>