10 4 4 Figure 1: The Network Topology and associated edge costs in Problem 5 Problem 6 (20 points): For the network of Figure 1: (a) Show the final forwarding table (along with the distance vector) at node B as computed by the distance vector algorithm (you need not show all the steps but you can construct the forwarding table by manual inspection) 10 points) b) Show the application of the distance vector algorithm for computing the forwarding tables and distance vectors at every node in the network. Show the evolution of the forwarding tables and distance vectors at each node, with each iteration of the algorithm. (15 points)