00 Consider the below network, with the indicated link costs. Step 1 2 3 4 5 6 7 8 Question 1.1 Use Dijkstra's algorithm to compute the shortest path from node/router u to all other network nodes. Show how the algorithm works by filling out the columns/cells of the provided table. In the given table, D(n) represents the cost of current shortest distance from node u to node n, and p(n) represents the entire current shortest path from node u to node n (comprising all the intermediate nodes on that path). u Set N Routing Algorithm & Forwarding Tables Using Dijkstra D(s), p(s) 5, u D(t), p(t) D(V), p(v) D(w), p(w) D(x), p(x) 1, u D(y), p(v) 2, u D(z), p(z) Question 1.2 Based on the results from Question 1.1, what is the shortest path from node u to node x, and what is the respective cost of this path. Question 1.2 table on the node u. Based on the results from Question 1.1, fill out the resulting forwarding Destination Node/Router S t u V W X N Next Hop Node/Router self direct direct