DIJKSTRA'S LINK STATE ALGORITHM (FOR COMPUTING LEAST COST PATHS) Consider the 6-node network shown below, with the given link costs. Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Show your work in tabular format, Solution:Nprime D(u),p(u)D(v),p(v)D(w),p(w)D(x),p(x)D(y),p(y)D(z),p(z) After completing the table, redraw the 6-node network showing the shortest path from u Lastly, give the routing table for node u