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. 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. To enter the ca symbol, use ALT 236 if you are on a Windows PC, or use [Option]+[5] if you are on a Mac.) Step N' Dit\p(t) Diulplu) Divl.plv) Diwl. p(w) Dly\ply) D(z).p(z) 1 2 3 4 11 5 6 X XV XVW xvwy xvwyu xvwyut xvwyutz Edit View Insert Format Tools Table 12pt Paragraph BILA 2