1. In the store-and-forward packet switching network shown in the figure 1 below, the data transmission speed of all links is 100Mbps, and the size of a packet is 1000 bytes, in which the packet header size is 20 bytes. (2) Let (A, B, 8) represent the delay from the router A to the router B, then the communication subnet between P, and P2 can be represented by (A, B, 8), (B, C, 4), (C, D, 3), (D, H, 5), (A, E, 5), (B, E, 2), (E, H, 3), (A, F, 6), (F, G, 3), (E,G, 1) and (G, H, 7). Suppose the distance vector routing algorithm is used here. Please explain after how many times of exchanges the routing tables can reach stable states, and take the router A as an example to draw all routing tables up to a stable state. B D E H P. P. G Fig. 1 A packet switching network