(Solved): Only c) and d) please Consider the network shown in Problem P3. Using Dijkstra's algorithm, and ...

Only c) and d) please

Consider the network shown in Problem P3. Using Dijkstra's algorithm, and showing your work using a table similar to Table 5.1, do the following: a. Compute the shortest path from $$t$$ to all network nodes. b. Compute the shortest path from $$u$$ to all network nodes. c. Compute the shortest path from $$v$$ to all network nodes. d. Compute the shortest path from $$w$$ to all network nodes. e. Compute the shortest path from $$y$$ to all network nodes. f. Compute the shortest path from $$z$$ to all network nodes.