corresponding entries in the NAT translation table. 58.83148180 rage 1 or Dr. Chen Fall 2018 Question 4. Consider the network on the right. With the indicated link costs, use Dijkstra's shortest-path algorithm (provided below) to compute the shortest path from node t to all network nodes. Show how the algorithm works by computing a table similar to the example provided below. LD uxy uxyv 4 X