$5\mathrm{.}02-2.$ Dijkstra's Algorithm $(2.$ part $2)$ Consider the network shown below, and Dijkstra's link$-$state algorithm Here we are interested in computing the least cost path from nodey $($note not node $$l$)$ to all other nodes using Dista's algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the first row in the table below showing the link state algorithms execution by matching the table entries $($a$),$ b$),$ c$),($d$)$ and a with their values. Write down your final correct answer, as you'll need it for the next question u can find more presso $5$ SW $421$ N $38$ X Sye $6$ Z Step D$($u$).$Plu$)$ DV$).$D$($U$)$ D$($w$).$p$($W$)$ D$($X$).$P$($x$)$ D$($z$).$pdx$)01$ N y $($a$)$ ib$)$ c$)1.$y $($d$)$ le $(0)$ e$)$ Ainty $89,$ C$\mathrm{.}5$ Dyz EX Fyw G$3.$ H$46.|5\mathrm{.}02\mathrm{.}4.$ Dijkstra's Algorithm $(2.$ part $4).$ Consider the network shown below and Dijkstra's link$-$state algorithm Here we are interested in computing the least cost path from node y $($note not node uly to all other nodes using Dikstra's algorithm Using the algorithm statement used in the textbook and es visual representation complete the first row in the table below showing the Ink state algorithm's execution by matching the table entries $($al$.$ D$).$ c$)$ and $($d$)$ with their values You can find more to promotec $85$ EW $42221$ Sy $618$ w N D$($u$).$plu$)\_$DV$).$P$($V$)$ DW$.$P$($W$)$ D$($x$).$P$($x$)$ D$($z$).$plz$)$ Y Step $0123..1.$y $1.1.$y $($a$)[$b$]($c$)[$d$]$ PRO $<<<<$ a$)$ b$)($c$)$ d$)$ A $3$x B$5.$ Cywxv D$\mathrm{.}7$ E F $4$X G $5$x H$$T