Consider an ad hoc network of 4 nodes with the topology as in Fig.1.

a. Describe the routing table of each node after each routing information update (for the routeto each destination, indicate the next hop, and the cost metric as the number of hops), until theyconverge to a stable state. Initially, each node only has routes to its neighbors. Ignore sequencenumbers.

b. Consider the stable routing tables that have converged as in part a. Now the link betweennodes C and D is broken. Assume that sequence numbers are not used. Describe a sequence ofevents that will result in a routing loop (and thus lead to the count-to-innity problem) betweennodes A and B.

c. For part b, assume that sequence numbers are used and explain how they can prevent theformation of the routing loop.

Figure 1: Topology of an ad hoc network