4 10 4 4 Figure 1: Network topology and associated edge costs Problem 2: For the network of Figure 1 show the application of the distance vector algorithm for computing the forwarding tables at every node in the network. Show the evolution of the forwarding tables at each node, with each iteration of the algorithm. Problem 3: Consider the network topology of Figure 2. Compute the minimum-cost spanning tree using