1. (6 points) Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to computelthe shortest path from t to all network nodes. Show how the algorithm works by computing the tables similar to the ones on Slide 16 and Slide 17 of Chapter 5. Note, when you have a tie on line 9 in the LS algorithm on slide 14 of Chapter 5, always choose the "W" node in the reverse-alphabetic order. E.g. if D(m) is equal to D(n), choose n instead of m for W since n is alphabetically larger than m. 12 4 4 Your answer Step N