In the network of Figure 19.1 (p.593), the current routing table of N1 is given in (a) below. Assume N1's neighbors N2, N3, and N4 learn of the network cost change before N1. Each of these neighbors update its delay vector in D_2, D_3, and D_4, and sends a copy to all of its neighbors, including N1. With these updated D vectors being received, your job is to apply the Distance-Vector routing approach to help N1 to generate a new routing table by filling all 10 yellow boxes in (c) so N1 can use it to replace the old one