Time left 0:03:32\ Question 5\ Not yet\ answered\ Marked out of\ 9.00\ P Flag\ question\ The network topology shown in the figure below includes the cost for each link, as provided in the table below.\ \\\\table[[link,

a

,

b

,

c

,

d

,

e

,

f

,

g

,

h

The network topology shown in the figure below includes the cost for each link, as provided in the table below. Use Dijkstra's algorithm to find the shortest path from Node u to all other nodes. Fill in the table below with the intermediate steps and the tentative distances/cost at each iteration/step