The Diagram Shows the Roads Connecting Four Cities $\mathrm{W}$ And $\mathrm{Z}$ By Passing Through at Most One City? (Hint: Write a Many

Multiple Choice

The diagram shows the roads connecting four cities.
How many ways are there to travel between cities $\mathrm{W}$ and $\mathrm{Z}$ by passing through at most one city? (Hint: Write a matrix, A, to represent the number of routes between each pair of cities without passing through another city. Then calculate $\mathrm{A}^{2}$ ) .

A) 1
B) 3
C) 4
D) 5