Figure 1 C(A), P(A Find the least congested paths from C to all other network nodes assuming link state routing, i.e., choosing the path with the lowest congestion level. Show the steps in your computation C(v): Congestion of path from source node C to destination v P(v): Previous node (neighbor of v) along the current least congested path from C to N: set of nodes whose least-cost path from the source is definitely known For example, the congestion level of path from C to B via A, i.e., C(B) when p(B)-A, is defined as: max Congestion C-A, congestion A-B)-max (1,3 -3. The goal is to find a path that offers the lowest congestion, i.e, minimum C(v), among all available paths. If two paths to the same node v have the same congestion level, break ties by picking the path with the minimum hop counts. (a) (12 pts.) Use Dijkstra's shortest path algorithm to find the least congested path from C to all other network nodes. Show how the algorithm works by completing the table below the figure