There are four cities A, B, C and D in Wonderland. You can get from city A to city B by 6 highways, and from city B to city C by 4 highways. There are two highways running from city A to city D. City D and city B have two highways connecting them as well. How many ways are there to get from city A to city C?
2 answers:
The first thing you have to do i
Answer: 48 ways
Step-by-step explanation:
Given data:
city A to city B = 6 highways
city B to city C = 4 highways.
City D to city B = 2 highways
city A to city D = 2 highways.
Solution:
How many ways are there to get from City A to City C
• using multiplication rule
= 6 * 4 * 2
= 48ways
There are 48 ways to travel from City A to C.
You might be interested in
Answer:
=m2+6mn+9n2
Step-by-step explanation:
=(m+3n)(m+3n)
=(m)(m)+(m)(3n)+(3n)(m)+(3n)(3n)
=m2+3mn+3mn+9n2
Answer:
The shadow is not the same image as the lady
Step-by-step explanation:
Had it in a test got it right
Trapezoid:
•Can have congruent diagonals. •Has one pair of opposite, parallel sides.
Kites:
•Has congruent adjacent sides.
•Has perpendicular diagonals.
Answer:
See explanation
Step-by-step explanation:
The surface area of the solid generated by revolving the region bounded by the graphs can be calculated using formula
If
and
Therefore,
Apply substitution
Then
Now
Hence,
Let the only force acting on the ball is the gravity (free-failing) and the ball was initially stationary
