Multiple Choice (Can be more than or at least one answer, but not all)

Distance Vector algorithms

(a) can be based on the Bellman Ford equation

(b) do not require the router to have a complete knowledge of the network topology

(c) have a deterministic convergence time

(d) may be subject to the Count to Infinity problem