Which two statements correctly describe distance-vector routing protocols? (Choose two)

Distance-vector protocols inherently calculate the next-hop router that packets should take to reach a destination subnet by determining the best direction (vector) and distance.

Distance-vector protocols, particularly older ones like RIP, are known for slower convergence times compared to link-state protocols due to issues like count-to-infinity.

Distance-vector protocols do not build a complete topology map of the network; instead, each router maintains only its own routing table, learning paths from its immediate neighbors.

Distance-vector protocols propagate topology changes hop-by-hop to their neighbors, rather than immediately updating all other devices across the entire network.

Distance-vector routing protocols utilize various metrics, such as hop count (RIP) or a composite metric (EIGRP) considering bandwidth, delay, reliability, and load, to quantify the 'distance' to a destination network.