Suppose the matrix represents a railroad map between cities 1, 2, 3, 4, and 5.
=
⎣ ⎢ ⎢ ⎢ ⎡
0 1 2 1 1
2 0
1 1
1 1
0 2
02
1 1
1 1
0 0
3 0
20
⎦ ⎥ ⎥ ⎥ ⎤
a. how many different ways can you travel from city 1 to city 3 with exactly one connection?
b. how many different ways can you travel from city 1 to city 5 with exactly one connection?
c. how many different ways can you travel from city 2 to city 5 with exactly one connection?