$5\mathrm{.}03-2.$ Dijkstra's Algorithm $(3,$ part $2).$ Consider the network shown below, and Dijkstra$$s link$-$state algorithm. Here, we are interested in computing the least cost path from node E to all other nodes using Dijkstra's algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the "Step $1"$ row in the table below showing the link state algorithm$$s execution by matching the table entries $($i$),($ii$),($iii$),($iv$)$ and $($v$)$ with their values. Write down your final $[$correct$]$ answer, as you$$ll need it for the next question. $[$