Let a =
0 1 2
2 0 1
1 2 0
, b =
0 2 1
1 0 1
2 2 0
, c =
0 2 1
0 0 1
1 2 0
represent the routes of three airlines a, b, and c between
three cities.
a. zane wants to fly from city 1 to city 3 by taking airline a first and then airline b second. how many different
ways are there for him to travel?
b. zane did not like airline a after the trip to city 3, so on the way home, zane decides to fly airline c first and
then airline b second. how many different ways are there for him to travel?