Q22. (20%) The following table is used to compute the shortest path from A to all other nodes in a network according to link-state algorithm. Dv),P(v) D(w),P(w) 5,u 4,x 3.y 3.y Step D(x),P(x) Dy),P(y) D(z),P(z) ul ux ux uxyv uxyvw uxyvwz A. Interpret the table in your words B. Consider the network shown in the following diagram. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from x to all other network nodes. Show how the algorithm works by computing a table similar to the one above. 3