Question 4 Not yet answered Points out of 15.00 P Flag question Provided figure shows a network with 6 nodes and 10 links. Number on each link is the cost of the link. Apply Dijkstra's algorithm for source node w. To get full points: (1) Fill in the trace table. (2) Show the resulting shortest path tree (for node w). (3) Show the resulting forwarding table (for node w). 5 5 7 8 2 3 3 7 Step N' D(u).p(u) D(v).p(v) D(x).p(x) D(y).ply) D(z).p(z) 0 w 1 2. 3 4 5