You Are Asked to Provide a Design That Allows Full

Multiple Choice

You are asked to provide a design that allows full dynamic routing updates between two networks: one network runs OSPF, and the other network runs EIGRP. Two links with an EIGRP neighbor relationship are provided to connect the networks and exchange routes. You are considering the use of routing loops. Which route-filtering method should you recommend, in order to prevent loops with the least amount of reconfiguration effort?

A) distribute lists
B) offset lists
C) route filtering
D) route tagging