Please also provide the answer for b), thanks!

(a) Figure 5 illustrates the graph model of a computer network where the DV algorithm is used for routing. Node C has just received from its neighbors the following distance vectors: i) from B: DB = (DB(A), Dp(B), Dp(C),D5(D), D3(E), Dp(P)) = (5,0,8, 12, 16, 2) ii) from D: Do = (DD(A), D. (B), D.(C), D (D), DD(E), D.(F)) = (16, 12, 6, 0, 9, 10) ii) from E: De = (DB(A), D.(B). Dr(C), De(D), DeCE), De(F)) = (7,6, 3, 9, 0, 4) The costs to nodes B. D, and E are 6, 3, and 5, respectively. What is the new routing table of C? Provide the expected cost to each node of the network. B D Figure 2: Graph model of a computer network. (b) Assume that in a network of 50 routes, the costs of the links are represented as 8-bit numbers. In addition, the exchange of distance vectors between the routers is happening twice every second. What is the bandwidth consumed by the distributed DV algorithm at each (full duplex) link? Note the network is fully connected (all the network routers are connected to each other)