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? PLEASE HELP ME I REALLY NEED THIS QUESTION ANSWERED

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.

answer

the correct answer is

explanation

the given function is

the excluded values are obtained by solving:

we factor to obtain:

the excluded values are

765238725478629038640962136509762139056074

step-by-step explanation:

64087235609746097215074621039754021037