Which routing protocol calculates paths using a distance-vector approach, periodically exchanges its entire routing table with directly connected neighbors, and is known to suffer from the 'count-to-infinity' problem?

RIP (Routing Information Protocol) is a classic distance-vector protocol that periodically broadcasts its complete routing table to directly connected neighbors, using hop count as its metric; this design makes it prone to the 'count-to-infinity' problem, where a route to a now-unreachable network is slowly incremented hop by hop as neighbors keep passing stale information to each other. OSPF and IS-IS are link-state protocols that instead flood topology information and compute shortest paths independently, BGP is a path-vector protocol used between autonomous systems on the internet, and EIGRP is Cisco's hybrid protocol that improves on classic distance-vector behavior using diffusing update algorithms.