For the network given below in Figure. 1, give global distance-vector tables like those on textbook(Computer Networks Fifth Edition by Larry Peterson) Table 3.10, 3.13 WHEN: (a) Each node knows only the distance of its immediate neighbors.

(b) Each node has reported the information it had in the preceding step to its immediate neighbors.

(c) Repeat step (b) one more time.

Show how the link-state algorithm builds the routing table for node D.

(d) Show the detailed link-state algorithm.

(e) Show the final routing table of node D.

3 4 4 2 Figure. 1