Consider the network topology shown below. The topology consists of multiple routers interconnected by full-duplex links. Each link has a static cost associated with it, which represents the cost of sending data over that link. For example, the link from B to F has a cost of 6. All of the links are symmetric (i.e. the cost is the same in both directions, such as between B and F). A 3 B 1 C 3 6 E 4 FL D 1 4 G (a) If we use Bellman-Ford's distributed algorithm to find the shortest path between every pair of nodes, how many steps will it take for the algorithm to converge in this case? Explair' (b) In general if we have a network with N nodes, what is the maximum number of steps for the Bellman-Ford algorithm to converge? Explain!