theloraxhater
contestada

Suppose the matrix R represents a railroad map between cities 1, 2, 3, 4, and 5.


How many different ways can you travel from city 1 to city 3 with exactly 1 connection


How many different ways can you travel from city 2 to city 5 with exactly one
connection?

Suppose the matrix R represents a railroad map between cities 1 2 3 4 and 5 How many different ways can you travel from city 1 to city 3 with exactly 1 connecti class=

Respuesta :

lhmarianateixeira

Observing the given matrix we can say that:

1) The value is 4.

2) The value is 2.

So analyzing the different paths that can connect city 1 to city 3: The value is 4. It represents the number of one-stop routes between City 1 and City 3 that pass through City 2.

For the second statement we will have the value is 2. It is the number of direct routes from  City 2 to City 5.

Learn more: brainly.com/question/16823190

Otras preguntas