the above network, the current routing table of NS is given below. Assume N5s nelidbors Ha,Ma, and N4 leam of the network cost change before N5. Each of these nelghbors update its delay vedorin D2, D3, and D4 and sends a copy to all of its neighbors, including NS.with these updated D vectors being received, your job is to apply the Distance Vector routing approach to help N5to generate anew routing table by filling five yellow empty boxes from (n to tv in c so NS can use it to replace the old one n (c)Nodes's touting tatle (b) Delay vectors sent to node 5 (a) Node 5's Routing from neighbor nodes table before update the above network, the current routing table of NS is given below. Assume N5s nelidbors Ha,Ma, and N4 leam of the network cost change before N5. Each of these nelghbors update its delay vedorin D2, D3, and D4 and sends a copy to all of its neighbors, including NS.with these updated D vectors being received, your job is to apply the Distance Vector routing approach to help N5to generate anew routing table by filling five yellow empty boxes from (n to tv in c so NS can use it to replace the old one n (c)Nodes's touting tatle (b) Delay vectors sent to node 5 (a) Node 5's Routing from neighbor nodes table before update