Homework SourseIn a computer game players must travel from city A to city B
In a computer game players must travel from city A to city B to city C and then return to city A without retracting any of the origional route. There are 5 routes between city A and B and 4 routes between city B and city C. In how many different ways can be played?
A. 400
B. 240
C. 120
D. 20
In a computer game players must travel from city A to city B to city C and then return to city A without retracting any of the origional route. There are 5 routes between city A and B and 4 routes between city B and city C. In how many different ways can be played?
A. 400
B. 240
C. 120
D. 20
A. 400
B. 240
C. 120
D. 20
Solution
The number of ways to move from city A to city B=5
The number of ways to move from city B to city C=4
The number of ways to move from city C to city B without retracting the original route=3
The number of ways to move from city B to city A without retracting the original route=4
Total number of different ways=5*4*3*4=240
ans-> b)
