20. 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, as in Table 4.3 in the text. Nprime D(u),p(u) D(v),p(v) Diw), p (w) D(x),p(x) D(y),p(y) D(z),plz)