Suppose we have the forwarding tables shown in Table 3.19 for nodes A and F in a network where all links have cost 1.

Give a diagram of the smallest network consistent with these tables.

Table 3.19)

Table 3.19 Forwarding tables for Exercise 51. A Node B D E F Node [40] A B D E Cost 1 2 3 2 F Cost 2 3 1 2 1 Nexthop B B Nexthop C E