There are five cities in a network. The travel time for traveling directly from i to j is the entry a,, in the matrix below. The matrix is not symmetric (use directed graphs), and a = indicates that there is no direct route. Determine the least travel time and quickest route from i to j for each pair i, j. 10 20 8 17 0 70 5 22 33 14 13 0 15 27 30 17 0 10 15 12 8 0