Q1: Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from network E to all network nodes showing your answer with the necessary steps. 3 1 2 6 1 3 4