ssignment Question: Session 2 Find and draw the shortest path spanning tree (SPST) for the digraph shown in the figure using the Bellman-Ford algorthm, from all nodes to node C. Then apply the Max- Min Fair flow control algorithm to find the max-min fair flow vector for all sessions (shown in red). Assume the capacity of all links to be 10 Gbps (Hint: All flows take the minimum cost path) 12 Session 1 TAC 4 8 Session 3 Session4 rEC ssignment Question: Session 2 Find and draw the shortest path spanning tree (SPST) for the digraph shown in the figure using the Bellman-Ford algorthm, from all nodes to node C. Then apply the Max- Min Fair flow control algorithm to find the max-min fair flow vector for all sessions (shown in red). Assume the capacity of all links to be 10 Gbps (Hint: All flows take the minimum cost path) 12 Session 1 TAC 4 8 Session 3 Session4 rEC