2. Dijkstra's Link State Algorithm (for computing least cost paths) Consider the 6-node network shown below, with the given link costs. 5 5 8 3 8 7 5 3 Before doing this problem, you might want to reread the section on Dijkstra's algorithm in chapter 5 and view this youtube video that fits our slides https://www.youtube.com/watch?v-V5-sqVTB49g. A. 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 lecture slide for Chapter 5 (pg 5-15). N' D (u),p (u) D(v),p(v) D(w),p(w) D(x),p(x) D(y),p (y) D(z) ,p (z) Thus, the links in the least cost routing tree from node u to all destinations are? (ex. u-b, u-d, etc.) B