What are two features that distance-vector routing protocols can use to address the count-to-infinity problem? (Choose two.)
A. split horizon
B. adjacency dead timers
C. route tagging
D. triggered updates
E. route poisoning
What are two features that distance-vector routing protocols can use to address the count-to-infinity problem?