\begin{tabular}{|l|l|c|c|} \hline \multicolumn{2}{|c|}{ Road Segment Endpoints } & Time(Min) & Distance(Miles) \\ \hline S & 2 & 94 & 59 \\ \hline S & 3 & 138 & 100 \\ \hline 2 & 4 & 110 & 104 \\ \hline 4 & 3 & 220 & 205 \\ \hline 4 & 5 & 120 & 119 \\ \hline 5 & 6 & 485 & 371 \\ \hline 3 & 7 & 216 & 208 \\ \hline 3 & 8 & 165 & 161 \\ \hline 6 & 8 & 138 & 131 \\ \hline 6 & 9 & 313 & 256 \\ \hline 8 & 10 & 151 & 118 \\ \hline 7 & 10 & 184 & 181 \\ \hline 7 & 11 & 272 & 241 \\ \hline 10 & 9 & 172 & 175 \\ \hline 10 & 11 & 190 & 140 \\ \hline 9 & 12 & 163 & 164 \\ \hline 11 & 13 & 347 & 283 \\ \hline 12 & 13 & 265 & 205 \\ \hline 12 & 14 & 162 & 133 \\ \hline 12 & 1 & 235 & 154 \\ \hline 14 & 1 & 287 & 193 \\ \hline 13 & 1 & 142 & 65 \\ \hline \end{tabular} Question 2. The table below shows all connections in the transportation network (if a connection is not in the table, that arc does not exist in the network). In the data in the table, we assume that travel distances and times are the same in both directions along each arc. (a) Use Dijkstra's algorithm to calculate the shortest-distance (mileage) route between node s and node t. Show your work by turning in all of the following: - Completed table (as we did in class) on page 4. - A graph of the network with the shortest-distance tree clearly indicated on the network. Question 2 (a) Question 2. The table below shows all connections in the transportation network (if a connection is not in the table, that are does not exist in the network). In the data in the table, we assume that travel distances and times are the same in both directions along each are. (a) Use Dijkstra's algorithm to calculate the shortest-distance (mileage) route between node s and node t. Show your work by turning in all of the following: - Completed table (as we did in class) on page 4. - A graph of the network with the shortest-distance tree clearly indicated on the network. (b) Use the Bellman-Ford-Moore algorithm to calculate the shortest-time route between node s and node t. Show your work by turning in all of the following: - Completed table (as we did in class) on page 5. - A graph of the network with the shortest-time tree clearly indicated on the network. Question 2 (a)