Suppose we have the forwarding tables shown in Table 3.18 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.18)

Table 3.18 Forwarding tables for Exercise 50. A Node B D E F Node ABCDE T Cost 1 2 1 2 3 F Cost 3 2 1 2 1 Nexthop B B D B DI Nexthop E E E