Suppose the routers are A, B, C, D, E and F, and all link costs are 1. The distance-vector forwarding tables for A and F are below. Give the network with the fewest links that is consistent with these tables. Hint: any destination reached at cost 1 is directly connected; if X reaches Y via Z at cost 2, then Z and Y must be directly connected.

As table

dest	cost	next_hop
B	1	B
C	1	C
D	2	C
E	2	C
F	3	B

Fs table

dest	cost	next_hop
A	3	E
B	2	D
C	2	D
D	1	D
E	1	E