Two popular routing tables are Distance

Vector and Link State routing, which of the following are true?

1. count-to-infinity is a problem only is

distance vector and not in link state routing.

2. In link state, the shortest path

algorithm is run only at one node.

3. In distance vector, the shortest path

algorithm is run only at one node.

4. Distance vector require lesser number

of network message than link state.