Show work. I'm double checking my work. Thank you.

Consider the following network. With the indicated link costs, use Dijkstra's Shortest Path Algorithm to compute the shortest path from x to all network nodes, and place them in a table like the one shown in the video. W Fill out and submit the tabular summary is the format shown. (This is similar to the table in slide 5-13 or Table 5.1, page 381 in the textbook.) Step N D(t),p(t) D(u),plu) D(V),p(V) D(w),p(w) D(y),ply) D(z),p(z) O 1 X XV xvu xvuw Xvuwy xvuwyt xvuwytz